Linear, Cone and Semidefinite Programming Submissions  2019
January 2019
A Geometrical Analysis of a Class of Nonconvex Conic Programs for Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems
Sunyoung Kim, Masakazu Kojima, KimChuan Toh
February 2019
Semidefinite Programming
Exploiting Sparsity for SemiAlgebraic Set Volume Computation
Matteo Tacchi, Tillmann Weisser, Jean Bernard Lasserre, Didier Henrion
Semidefinite Programming
Interior Point Method on Semidefinite Linear Complementarity Problems using the NesterovTodd (NT) Search Direction: Polynomial Complexity and Local Convergence
Chee Khian Sim
Linear Programming
Logarithmicbarrier decomposition interiorpoint methods for stochastic linear optimization in a Hilbert space
Baha Alzalg, Akhtar Khan
March 2019
SecondOrder Cone Programming
Decomposition interiorpoint methods based on unital JHalgebras for stochastic conic optimization in spin factors
Baha Alzalg
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with blockclique graph structures
Sunyoung Kim, Masakazu Kojima, KimChuan Toh
Semidefinite Programming
CONICOPF: A tightandcheap conic relaxation with accuracy metrics for singleperiod and multiperiod ACOPF problems
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
Semidefinite Programming
An Augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem
Ernesto G. Birgin, Walter Gómez, Gabriel Haeser, Leonardo M. Mito, Daiana S. Viana
Semidefinite Programming
Tractable semialgebraic approximation using ChristoffelDarboux kernel
Swann Marx, Edouard Pauwels, Tillmann Weisser, Didier Henrion, Jean Bernard Lasserre
April 2019
Linear Programming
LogarithmicBarrier Decomposition InteriorPoint Methods for Stochastic Linear Optimization in a Hilbert Space
Baha Alzalg
Semidefinite Programming
Noisy Euclidean Distance Matrix Completion with a Single Missing Node
Stefan Sremac, Fei Wang , Henry Wolkowicz, Lucas Pettersson
Semidefinite Programming
Lower Bounds for the Bandwidth Problem
Franz Rendl, Renata Sotirov, Truden Christian
Semidefinite Programming
BurerMonteiro guarantees for general semidefinite programs
Diego Cifuentes
SelfConcordance and Matrix Monotonicity with Applications to Quantum Entanglement Problems
Leonid Faybusovich, Cunlu Zhou
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Etienne de Klerk, Monique Laurent
A Projective Approach to Nonnegative Matrix Factorization
Patrick Groetzner
May 2019
Semidefinite Programming
A convex relaxation to compute the nearest structured rank deficient matrix
Diego Cifuentes
Polyhedral approximations of the semidefinite cone and their applications
Yuzhu Wang, Akihiro Tanaka, Akiko Yoshise
SecondOrder Cone Programming
Detection and Transformation of SecondOrder Cone Programming Problems in a GeneralPurpose Algebraic Modeling Language
Jared Erickson, Robert Fourer
Linear Programming
Distributed DantzigWolfe Decomposition
Mohamed El Tonbari, Shabbir Ahmed
Improved convergence analysis of Lasserre's measurebased upper bounds for polynomial minimization on compact sets
Lucas Slot, Monique Laurent
A primaldual interiorpoint algorithm for nonsymmetric exponentialcone optimization.
Joachim Dahl, Erling Andersen, D.
A Newtonbracketing method for a simple conic optimization problem
Sunyoung Kim, Masakazu Kojima, KimChuan Toh
July 2019
Linear Programming
First Experiments with StructureAware Presolving for a Parallel InteriorPoint Method
Ambros Gleixner, NilsChristian Kempke, Thorsten Koch, Daniel Rehfeldt, Svenja Uslu
August 2019
Linear Programming
A massively parallel interiorpoint solver for linear energy system models with block structure
Rehfeldt Daniel, Hannes Hobbie, David Schönheit, Ambros Gleixner, Thorsten Koch, Domink Möst
Semidefinite Programming
Error Bounds and Singularity Degree in Semidefinite Programming
Stefan Sremac, Hugo J. Woerdeman, Henry Wolkowicz
Semidefinite Programming
A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics
Anirudha Majumdar, Georgina Hall, Amir Ali Ahmadi
Linear Programming
On the existence of a short pivoting sequence for a linear program
Anders Forsgren, Fei Wang
September 2019
Semidefinite Programming
A relaxed interior point method for lowrank semidefinite programming problems
Stefania Bellavia, Jacek Gondzio, Margherita Porcelli
Semidefinite Programming
On Polyhedral and SecondOrderCone Decompositions of Semidefinite Optimization Problems
Dimitris Bertsimas, Ryan CoryWright
October 2019
The Outcome Range Problem
Mohsen Mohammadi, Monica Gentili
A Strictly Contractive PeacemanRachford Splitting Method for the Doubly Nonnegative Relaxation of the Minimum Cut Problem
Xinxin Li, Ting Kei Pong, Hao Sun, Henry Wolkowicz
November 2019
SecondOrder Cone Programming
Exploiting Aggregate Sparsity in Second Order Cone Relaxations for Quadratic Constrained Quadratic Programming Problems
Heejune Sheen, Makoto Yamashita
Semidefinite Programming
Decomposed Structured Subsets for Semidefinite and SumofSquares Optimization
Jared Miller, Yang Zheng, Mario Sznaier, Antonis Papachristodoulou
Semidefinite Programming
On the tightness of SDP relaxations of QCQPs with repeated eigenvalues
Alex L. Wang, Fatma KilincKarzan
Other
The extreme rays of the $6\times6$ copositive cone
Andrei Afonin, Roland Hildebrand, Peter J.C. Dickinson
December 2019
Rational Polyhedral OuterApproximations of the SecondOrder Cone
Burak Kocuk
Linear Programming
Linear Programming using LimitedPrecision Oracles
Ambros Gleixner, Daniel E. Steffy
Semidefinite Programming
Polynomial time guarantees for the BurerMonteiro method
Diego Cifuentes, Ankur Moitra
Gaddum's test for symmetric cones
Michael Orlitzky
A Limiting Analysis on Regularization of Singular SDP and its Implication to Infeasible Interiorpoint Algorithms
Takashi Tsuchiya, Bruno F. Lourenco, Masakazu Muramatsu, Takayuki Okuno
Linear Programming
A New Preconditioning Approach for an Interior PointProximal Method of Multipliers for Linear and Convex Quadratic Programming
Luca Bergamaschi, Jacek Gondzio, Ángeles Martínez, John W. Pearson, Spyridon Pougkakiotis
Semidefinite Programming
Facial Reduction for Symmetry Reduced Semidefinite Programs
Hao Hu, Renata Sotirov, Henry Wolkowicz
