-

 

 

 




Optimization Online





 

Linear, Cone and Semidefinite Programming Submissions - 2012

January 2012

Semi-definite Programming
Existence and stability results based on asymptotic analysis for semidefinite linear complementarity problems
Julio López, Rubén López, Hector Ramírez C.

Other
Linear complementarity problems over symmetric cones: Characterization of Qb-transformations and existence results
Julio López, Rubén López , Héctor Ramírez C.

Symmetry in RLT cuts for the quadratic assignment and standard quadratic optimization problems
Etienne De Klerk, Marianna Eisenberg-Nagy, Renata Sotirov, Uwe Truetsch


February 2012

Linear Programming
An upper bound for the number of different solutions generated by the primal simplex method with any selection rule of entering variables
Tomonari Kitahara, Shinji Mizuno

Linear Program Relaxation of Sparse Nonnegative Recovery
Linxia Qin, Naihua Xiu, Lingchen Kong, Yu Li

Linear Programming
Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization
Luke Wnternitz, Andre Tits, P.-A. Absil

Linear Programming
A regularised simplex method
Csaba I. Fabian, Krisztian Eretnek, Olga Papp


March 2012

Other
Irreducible elements of the copositive cone
Peter J.C. Dickinson, Mirjam Dür, Luuk Gijben, Roland Hildebrand

Logarithmic barriers for sparse matrix cones
Martin Andersen, Joachim Dahl, Lieven Vandenberghe

Other
Scaling relationship between the copositive cone and Parrilo's first level approximation
Dickinson Peter J.C., Duer Mirjam, Luuk Gijben, Roland Hildebrand

Semi-definite Programming
Complexity of the positive semidefinite matrix completion problem with a rank constraint
Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis


April 2012

Linear Programming
Decomposition Methods for Large Scale LP Decoding
Siddharth Barman, Xishuo Liu, Stark Draper, Benjamin Recht

Linear Programming
On Chubanov's method for Linear Programming
Amitabh Basu, Jesus De Loera, Mark Junod

Single-Row Equidistant Facility Layout as a Special Case of Single-Row Facility Layout
Philipp Hungerländer

Linear Programming
Parallel distributed-memory simplex for large-scale stochastic LP problems
Miles Lubin, J. A. Julian Hall, Cosmin G. Petra, Mihai Anitescu

Linear Programming
ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING
Zhang Leihong, Yang Weihong, Liao Lizhi

Semi-definite Programming
Containment problems for polytopes and spectrahedra
Kai Kellner, Thorsten Theobald, Christian Trabandt


May 2012

The simplex method and the diameter of a 0-1 polytope
Tomonari Kitahara, Shinji Mizuno

Semi-definite Programming
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices
Marianna Eisenberg-Nagy, Monique Laurent, Antonios Varvitsiotis

On the non-homogeneity of completely positive cones
M. Seetharama Gowda, Roman Sznajder

On the bilinearity rank of a proper cone and Lyapunov-like transformations
M. Seetharama Gowda, Jiyuan Tao

Semi-definite Programming
Analytical formulas for calculating extremal ranks and inertias of quadratic matrix-valued functions
Tian Yongge

Semi-definite Programming
Polytopes of Minimum Positive Semidefinite Rank
João Gouveia, Richard Z. Robinson, Rekha R. Thomas


June 2012

Other
Moment approximations for set-semidefinite polynomials
Peter Dickinson, Janez Povh

Linear Programming
Factoring nonnegative matrices with linear programs
Victor Bittorf, Benjamin Recht, Christopher Re, Joel Tropp

Upper bounds for packings of spheres of several radii
David de Laat, Fernando de Oliveira Filho, Frank Vallentin

Linear Programming
A new warmstarting strategy for the primal-dual column generation method
Jacek Gondzio, Pablo González-Brevis

The Nonnegative $l_0$ Norm Minimization under Generalized $Z$-matrix Measurement
Ziyan Luo, Linxia Qin, Lingchen Kong, Naihua Xiu

Other
On the cp-rank and the minimal cp factorization of a completely positive matrix
Immanuel M. Bomze, Florian Jarre, Werner Schachinger


August 2012

Semi-definite Programming
Convex computation of the region of attraction of polynomial control systems
Didier Henrion, Milan Korda

Second-Order Cone Programming
On Families of Quadratic Surfaces Having Fixed Intersections with Two Hyperplanes
Pietro Belotti, Julio C. Góez, Imre Pólik, Ted Ralphs, Tamás Terlaky

Semi-definite Programming
Mean squared error minimization for inverse moment problems
Didier Henrion, Jean-Bernard Lasserre, Martin Mevissen

Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
Jacek Gondzio


September 2012

A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
Naohiko Arima, Sunyoung Kim, Masakazu Kojima

Linear Programming
Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Silvana Bocanegra, Jordi Castro, Aurelio R.L. Oliveira


October 2012

Semi-definite Programming
The Spectral Bundle Method with Second-Order Information
Christoph Helmberg, Michael L. Overton, Franz Rendl

Lowest-rank Solutions of Continuous and Discrete Lyapunov Equations over Symmetric Cone
Ziyan Luo, Jiyuan Tao, Naihua Xiu

Simplified Copositive and Lagrangian Relaxations for Linearly Constrained Quadratic Optimization Problems in Continuous and Binary Variables
Naohiko Arima, Sunyoung Kim, Masakazu Kojima

Semi-definite Programming
A Semidefinite Approach to the $K_i$ Cover Problem
Jo{\~a}o Gouveia, James Pfeiffer


November 2012

The Slater condition is generic in linear conic programming
Mirjam Duer, Bolor Jargalsaikhan, Georg Still

Semi-definite Programming
Parallel Implementation of Successive Sparse SDP Relaxations for Large-scale Euclidean Distance Geometry Problems
Sunyoung Kim, Masakazu Kojima, Makoto Yamashita

Semi-definite Programming
A symmetric reduction of the NT direction
Florian Jarre, Chantal Hergenroeder


December 2012

Semi-definite Programming
A Primal-Dual Regularized Interior-Point Method for Semidefinite Programming
Ahad Dehghani, jean-Louis Goffin, Dominique Orban

Semi-definite Programming
On bounding the bandwidth of graphs with symmetry
Edwin van Dam, Renata Sotirov

Semi-definite Programming
On metric regularity for weakly almost piecewise smooth functions and some applications in nonlinear semidefinite programming
Peter Fusek


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society