Linear, Cone and Semidefinite Programming Submissions  2018
January 2018
Semidefinite Programming
Tightandcheap conic relaxation for the AC optimal power flow problem
Christian Bingane, Miguel Anjos, Sébastien Le Digabel
SecondOrder Cone Programming
The first heuristic specifically for mixedinteger secondorder cone optimization
Sertalp B. Çay, Imre Pólik, Tamás Terlaky
February 2018
Semidefinite Programming
Exact Semidefinite Formulations for a Class of (Random and NonRandom) Nonconvex Quadratic Programs
Samuel Burer, Yinyu Ye
March 2018
A factorization method for completely positive matrices
Patrick Groetzner, Mirjam Dür
Axial symmetry indices for convex cones: axiomatic formalism and applications
Alberto Seeger, Mounir Torki
Semidefinite Programming
Optimality conditions and global convergence for nonlinear semidefinite programming
Roberto Andreani, Gabriel Haeser, Daiana S. Viana
Computational performance of a projection and rescaling algorithm
Javier Pena, Negar Soheili
A Homogeneous PredictorCorrector Algorithm for Stochastic Nonsymmetric Convex Conic Optimization
Baha Alzalg, Mohammad Alabed Alhadi
April 2018
Conic optimization under combinatorial sparsity constraints
Christoph Buchheim, Emiliano Traversi
Solving Pooling Problems by LP and SOCP Relaxations and Rescheduling Methods
Masaki Kimizuka, Sunyoung Kim, Makoto Yamashita
Linear Programming
A quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems
I. L. Galabova, J. A. J. Hall
May 2018
Refining the partition for multifold conic optimization problems
Hector Ramirez C., Vera Roshchina
An ADMMBased InteriorPoint Method for LargeScale Linear Programming
Tianyi Lin, Shiqian Ma, Yinyu Ye, Shuzhong Zhang
June 2018
Strict Complementarity in MaxCut SDP
Marcel de Carli Silva, Levent Tunçel
The automorphism group and the nonselfduality of pcones
Masaru Ito, Bruno F. Lourenco
A multilevel analysis of the Lasserre hierarchy
Juan S Campos, Ruth Misener, Panos Parpas
July 2018
Semidefinite Programming
On positive duality gaps in semidefinite programming
Gabor Pataki
Semidefinite Programming
Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
Milan Korda, Didier Henrion, Igor Mezic
Semidefinite Programming
Semidenite Approximations of Invariant Measures for Polynomial Systems
Victor Magron, Marcelo Forets, Didier Henrion
Finding Minimum Volume Circumscribing Ellipsoids Using Copositive Programming
Areesh Mittal, Grani Hanasusanto
An improved projection and rescaling algorithm for conic feasibility problems
Wei Zhang, Kees Roos, Yanqin Bai
August 2018
Semidefinite Programming
Positive semidefinite matrix approximation with a trace constraint
Kouhei Harada
September 2018
Linear Programming
Implementation of an Interior Point Method with Basis Preconditioning
L. Schork, J. Gondzio
An oraclebased projection and rescaling algorithm for linear semiinfinite feasibility problems and its application to SDP and SOCP
Masakazu Muramatsu, Tomonari Kitahara, Bruno Lourenco, Takayuki Okuno, Takashi Tsuchiya
October 2018
Tightandcheap conic relaxation for the optimal reactive power dispatch problem
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
Nonconvex minmax fractional quadratic problems under quadratic constraints: copositive relaxations
Paula A. Amaral, Immanuel M. Bomze
November 2018
Semidefinite Programming
A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Etienne De Klerk, Monique Laurent
Linear Programming
A specialized interiorpoint algorithm for huge minimum convex cost flows in bipartite networks
Jordi Castro, Stefano Nasini
December 2018
Semidefinite Programming
A dual spectral projected gradient method for logdeterminant semidefinite problems
Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita
Linear Programming
A New Face Method for Linear Programming
PingQi Pan
