- Linear, Cone and Semidefinite Programming Submissions - 2016 January 2016 Quadratic Programs with Hollows Boshi Yang, Kurt Anstreicher, Samuel Burer The min-cut and vertex separator problem Franz Rendl, Renata Sotirov Semi-definite Programming Exact SDP Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems Shinsaku Sakaue, Akiko Takeda, Sunyoung Kim, Naoki Ito February 2016 Semi-definite Programming Solving rank-constrained semidefinite programs in exact arithmetic Simone Naldi Other A robust Lagrangian-DNN method for a class of quadratic optimization problems Naohiko Arima, Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh Linear Programming On geometrical properties of preconditioners in IPMs for classes of block-angular problems J. Castro, S. Nasini March 2016 Semi-definite Programming Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization Etienne de Klerk, Roxana Hess, Monique Laurent April 2016 Other Completely positive semidefinite rank Anupam Prakash, Jamie Sikora, Antonios Varvitsiotis, Zhaohui Wei Implementation of Interior-point Methods for LP based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya, Ken Hayami May 2016 Matrices with high completely positive semidefinite rank Sander Gribling, David de Laat, Monique Laurent Semi-definite Programming Chebyshev Inequalities for Products of Random Variables Napat Rujeerapaiboon, Daniel Kuhn, Wolfram Wiesemann June 2016 Semi-definite Programming Kronecker Product Constraints for Semidefinite Optimization K.M. Anstreicher Semi-definite Programming Application of Facial Reduction to $H_\infty$ State Feedback Control Problem Hayato Waki, Noboru Sebe July 2016 A bound on the Carathéodory number Masaru Ito, Bruno F. Lourenco Doubly Nonnegative Relaxations for Quadratic and Polynomial Optimization Problems with Binary and Box Constraints Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh Perturbation Analysis of Singular Semidefinite Program and Its Application to a Control Problem Yoshiyuki Sekiguchi, Hayato Waki Semi-definite Programming An inexact dual logarithmic barrier method for solving sparse semidefinite programs Stefania Bellavia, Jacek Gondzio, Margherita Porcelli Linear Programming An inexact potential reduction method for linear programming Lukas Schork, Jacek Gondzio August 2016 Semi-definite Programming A simple preprocessing algorithm for semidefinite programming Preston Faulk, Gabor Pataki, Quoc Tran-Dinh Low-Rank Matrix Completion using Nuclear Norm with Facial Reduction Shimeng Huang, Henry Wolkowicz Semi-definite Programming Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators Yu Hin (Gary) Au, Levent Tunçel Semi-definite Programming Graph bisection revisited Renata Sotirov September 2016 Linear Programming A generalized simplex method for integer problems given by verification oracles Sergei Chubanov Semi-definite Programming onvergence rates of moment-sum-of-squares hierarchies for optimal control problems Milan Korda, Didier Henrion, Colin N. Jones Semi-definite Programming On the identification of optimal partition and optimal solutions for semidefinite optimization Ali Mohammad-Nezhad, Tamas Terlaky October 2016 Linear Programming Can linear superiorization be useful for linear optimization problems? Yair Censor Linear Programming Linear superiorization for infeasible linear programming Yair Censor, Yehuda Zur Linear Programming Optimized choice of parameters in interior-point methods for linear programming Luiz Rafael Santos, Fernando Villas-Bôas, Aurelio Ribeiro Leite Oliveira, Clovis Perin Semi-definite Programming Moment methods in energy minimization: New bounds for Riesz minimal energy problems David de Laat Second-Order Cone Programming A Complete Characterization of Disjunctive Conic Cuts for Mixed Integer Second Order Cone Optimization Pietro Belotti, Julio Goez, Imre Polik, Ted Ralphs, Terlaky Tamas November 2016 Semi-definite Programming SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic Didier Henrion, Simone Naldi, Mohab Safey El Din Second-Order Cone Programming An Extension of Chubanov's Polynomial-Time Linear Programming Algorithm to Second-Order Cone Programming Tomonari Kitahara, Takashi Tsuchiya Linear Programming Fast approximate solution of large dense linear programs Leo Liberti, Pierre-Louis Poirion, Ky Vu Linear Programming An improved version of Chubanov’s method for solving a homogeneous feasibility problem Kees Roos December 2016 Linear Programming Rescaling Algorithms for Linear Programming Part I: Conic feasibility Daniel Dadush, Laszlo Vegh, Giacomo Zambelli Linear Programming A Successive LP Approach with C-VaR Type Constraints for IMRT Optimization Shogo Kishimoto, Makoto Yamashita Semi-definite Programming Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Milan Korda, Didier Henrion Linear Programming Permutations in the factorization of simplex bases Ricardo Fukasawa, Laurent Poirrier Semi-definite Programming A Multigrid approach to SDP relaxations of sparse polynomial optimization problems J.S. Campos Salazar, P. Parpas The p-cones in dimension n>=3 are not homogeneous when p \neq 2 Masaru Ito, Bruno F. Lourenco Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method Bruno F. Lourenco, Ellen H. Fukuda, Masao Fukushima An extension of Chubanov's algorithm to symmetric cones Bruno F. Lourenco, Tomonari Kitahara, Masakazu Muramatsu, Takashi Tsuchiya 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 Optimization Online is supported by the Mathematical Optmization Society.