Optimization Online


Linear, Cone and Semidefinite Programming Submissions - 2015

January 2015

Linear Programming
Looking for strong polynomiality in Linear Programming : Arguments, conjectures, experiments, findings, and concluson.
Peter A. Bruijs

Stratified simplex method for solving fuzzy multi-objective linear programming problem
Qiumei Liu

February 2015

A corrected semi-proximal ADMM for multi-block convex optimization and its application to DNN-SDPs
Li Shen, Shaohua Pan

Linear Programming
Vector Space Decomposition for Linear Programs
Jean Bertrand Gauthier, Jacques Desrosiers, Marco Lübbecke

March 2015

On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings
Sabine Burgdorf, Monique Laurent, Teresa Piovesan

A Framework for Applying Subgradient Methods to Conic Optimization Problems
James Renegar

Linear Programming
Parallelizing the dual revised simplex method
Q. Huangfu, J. A. J. Hall

Semi-definite Programming
New bounds for the max-$k$-cut and chromatic number of a graph
Edwin van Dam, Renata Sotirov

Linear Programming
A strong polynomial gradient algorithm in Linear Programming
P A Bruijs

April 2015

Semi-definite Programming
Quantum and classical coin-flipping protocols based on bit-commitment and their point games
Ashwin Nayak, Jamie Sikora, Levent Tunçel

Second-Order Cone Programming
First order optimality conditions for mathematical programs with second-order cone complementarity constraints
Jane Ye, Jinchuan Zhou

Linear Programming
Ping-Qi Pan

May 2015

Linear Programming
Dual Face Algorithm Using Gauss-Jordan Elimination for Linear Programming
Ping-Qi Pan

On measures of size for convex cones
Alberto Seeger

Semi-definite Programming
A Constraint-Reduced Algorithm for Semidefinite Optimization Problems with Superlinear Convergence
Sungwoo Park

Semi-definite Programming
A Constraint-reduced Algorithm for Semidefinite Optimization Problems using HKM and AHO directions
Sungwoo Park

Regularization vs. Relaxation: A conic optimization perspective of statistical variable selection
Hongbo Dong, Kun Chen, Jeff Linderoth

June 2015

Linear Programming
Iterative Refinement for Linear Programming
Ambros M. Gleixner, Daniel E. Steffy, Kati Wolter

Linear Programming
Alternating Direction Method of Multipliers for Linear Programming
Bingsheng He, Xiaoming Yuan

Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
Minghui Liu, Gabor Pataki

Second-Order Cone Programming
An efficient second-order cone programming approach for optimal selection in tree breeding
Makoto Yamashita, Tim J. Mullin, Sena Safarina

Second-Order Cone Programming
Second-Order Cone Programming for P-Spline Simulation Metamodeling
Yu Xia, Farid Alizadeh

A Polynomial Column-wise Rescaling von Neumann Algorithm
Dan Li, Kees Roos, Tamás Terlaky

Solving SDP Completely with an Interior Point Oracle
Bruno F. Lourenco, Masakazu Muramatsu, Takashi Tsuchiya

July 2015

Linear Programming
Using the Johnson-Lindenstrauss lemma in linear and integer programming
Ky Vu, Pierre-Louis Poirion, Leo Liberti

Semi-definite Programming
On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
Yule Zhang, Liwei Zhang

Primal-dual path-following algorithms for circular programming
Baha Alzalg

The circular cone: A new symmetric cone
Baha Alzalg

Simplified semidefinite and completely positive relaxations
Felix Lieder

Linear Programming
Closing the gap in pivot methods for linear programming
Venkat Narayan

Semi-definite Programming
Semidefinite approximations of the polynomial abscissa
Roxana Hess, Didier Henrion, Jean-Bernard Lasserre, Tien Son Pham

August 2015

Semi-definite Programming
A priori bounds on the condition numbers in interior-point methods
Florian Jarre

Second-Order Cone Programming
The solution of Euclidean norm trust region SQP subproblems via second order cone programs, an overview and elementary introduction
Florian Jarre

Inner Approximations of Completely Positive Reformulations of Mixed Binary Quadratic Optimization Problems: A Unified Analysis
E. Alper Yildirim

Semi-definite Programming
Noisy Euclidean distance realization: robust facial reduction and the Pareto frontier
D. Drusvyatskiy, N. Krislock, Y.-L. Voronin, H. Wolkowicz

September 2015

Linear Programming
Strong Duality: Without Simplex and without theorems of alternatives
Somdeb Lahiri

Linear conic formulations for two-party correlations and values of nonlocal games
Jamie Sikora, Antonios Varvitsiotis

Semi-definite Programming
Simple Approximations of Semialgebraic Sets and their Applications to Control
Fabrizio Dabbene, Didier Henrion, Constantino Lagoa

Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach
Permenter Frank, Henrik A. Friberg, Erling D. Andersen

Semi-definite Programming
Robust Sensitivity Analysis of the Optimal Value of Linear Programming
Guanglin Xu, Samuel Burer

Second-Order Cone Programming
Weak Infeasibility in Second Order Cone Programming
Bruno F. Lourenco, Masakazu Muramatsu, Takashi Tsuchiya

Examples with Decreasing Largest Inscribed Ball for Deterministic Rescaling Algorithms
Dan Li, Tamás Terlaky

A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
Ali Mohammad-Nezhad, Tamas Terlaky

Semi-definite Programming
Degeneracy in Maximal Clique Decomposition for Semidefinite Programs
Arvind Raghunathan, Andrew Knyazev

October 2015

DC Decomposition of Nonconvex Polynomials with Algebraic Techniques
Amir Ali Ahmadi, Georgina Hall

Sum of Squares Basis Pursuit with Linear and Second Order Cone Programming
Amir Ali Ahmadi, Georgina Hall

November 2015

Linear Programming
Benders Decomposition and Column-and-Row Generation for Solving Large-Scale Linear Programs with Column-Dependent-Rows
Ibrahim Muter, S. Ilker Birbil, Kerem Bulbul

The Algebraic Structure of the pth-order Cone
Baha Alzalg

Linear Programming
An improved version of Chubanov's method for solving a homogeneous feasibility problem
Kees Roos

Facial Reduction and Partial Polyhedrality
Bruno F. Lourenco, Masakazu Muramatsu, Takashi Tsuchiya

December 2015

The Algebraic Structure of the p-Order Cone
Alzalg Baha

Second-Order Cone Programming
The use of squared slack variables in nonlinear second-order cone programming
Ellen H. Fukuda, Masao Fukushima

Semi-definite Programming
Optimality conditions for nonlinear semidefinite programming via squared slack variables
Bruno F. Lourenco, Ellen H. Fukuda, Masao Fukushima

ADMM for the SDP relaxation of the QAP
Danilo Oliveira, Henry Wolkowicz, Yangyang Xu

Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation
Amir Ali Ahmadi, Sanjeeb Dash, Georgina Hall

Accelerated First-Order Methods for Hyperbolic Programming
James Renegar

Some Tractable Subcones and LP-based Algorithms for Testing Copositivity
Akihiro Tanaka, Akiko Yoshise

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


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