Two-phase simplex method for linear semidefinite optimization

DOI10.1007/S11590-018-1333-ZMaRDI QIDQ2010151zbMATH OpenOpenAlexWikidataFDO

Authors Vitaliǐ Grigor'evich Zhadan

Publication date 3 December 2019

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-018-1333-z

zbMATH Keywords

extreme pointslocal convergencetwo-phase methodlinear semidefinite programmingprimal simplex method

Mathematics Subject Classification ID

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

Recommendations

• A variant of the dual simplex method for a linear semidefinite programming problem
• A primal interior point method for the linear semidefinite programming problem
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
• An admissible dual internal point method for a linear semidefinite programming problem

Cites work

• scientific article; zbMATH DE number 1261669 (Why is no real title available?)
• A pivoting procedure for a class of second-order cone programming
• Complementarity and nondegeneracy in semidefinite programming
• Cone-LP's and semidefinite programs: geometry and a simplex-type method
• Handbook of semidefinite programming. Theory, algorithms, and applications
• Linear programming with positive semi-definite matrices
• Linear programming. Foundations and extensions
• ON MATRICES DEPENDING ON PARAMETERS
• Second-order cone programming
• Semidefinite Programming
• Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
• The Elimination Matrix: Some Lemmas and Applications

Cited in

(3)

• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Extension of the LP-Newton method to conic programming problems via semi-infinite representation
• A variant of the dual simplex method for a linear semidefinite programming problem

This page was built for publication: Two-phase simplex method for linear semidefinite optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010151)