Cone-LP's and semidefinite programs: Geometry and a simplex-type method

DOI10.1007/3-540-61310-2_13zbMath1415.90076OpenAlexW1595045940MaRDI QIDQ4645921

Gábor Pataki

Publication date: 11 January 2019

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61310-2_13

zbMATH Keywords

simplex methodstrong dualitysemidefinite programfeasible directionbasic solution

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items

Bounding duality gap for separable problems with linear constraints, On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials, Primal Newton method for the linear cone programming problem, Exact Recovery with Symmetries for the Doubly Stochastic Relaxation, The dual simplex-type method for linear second-order cone programming problem, A variant of the affine-scaling method for a second-order cone program, Graph rigidity via Euclidean distance matrices, A variant of the dual simplex method for a linear semidefinite programming problem, Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems, Two-phase simplex method for linear semidefinite optimization, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of optimization in matrix theory
• Geometric algorithms and combinatorial optimization
• Complementarity and nondegeneracy in semidefinite programming
• A semidefinite framework for trust region subproblems with applications to large scale minimization
• First and second order analysis of nonlinear semidefinite programs
• Cones of diagonally dominant matrices
• On a positive semidefinite relaxation of the cut polytope
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Approximate graph coloring by semidefinite programming
• Large-Scale Optimization of Eigenvalues
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Strong Duality for Semidefinite Programming
• On Eigenvalue Optimization
• An Interior-Point Method for Semidefinite Programming
• Convex Analysis