A numerical feasible interior point method for linear semidefinite programs

DOI10.1051/RO:2007006MaRDI QIDQ4600612zbMATH OpenOpenAlexFDO

Authors Djamel Benterki, J.-P. Crouzeix, B. Merikhi

Publication date 12 January 2018

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=RO_2007__41_1_49_0/

zbMATH Keywords

interior point methodslinear programmingsemidefinite programming

Mathematics Subject Classification ID

Linear programming (90C05) Semidefinite programming (90C22) Interior-point methods (90C51)

Recommendations

• A feasible primal-dual interior point method for linear semidefinite programming
• A primal interior point method for the linear semidefinite programming problem
• Infeasible interior point method for semidefinite programs
• A primal-dual infeasible interior point algorithm for semidefinite programming
• A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem

Cited in

(17)

• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
• Logarithmic barrier method via minorant function for linear semidefinite programming
• A feasible primal-dual interior point method for linear semidefinite programming
• A logarithmic barrier approach for linear programming
• A logarithm barrier method for semi-definite programming
• A primal interior point method for the linear semidefinite programming problem
• A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem
• A primal-dual infeasible interior point algorithm for semidefinite programming
• A relaxed logarithmic barrier method for semidefinite programming
• Study of a Logarithmic Barrier Approach for Linear Semidefinite Programming
• An efficient logarithmic barrier method without line search for convex quadratic programming
• Distance to a constitutive tensor isotropy stratum by the Lasserre polynomial optimization method
• A novel adaptive method based on new minorant-majorant functions without line search for semidefinite optimization
• Finding a strict feasible solution of a linear semidefinite program
• A feasible direction method for the semidefinite program with box constraints
• A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
• A boundary point method to solve semidefinite programs

This page was built for publication: A numerical feasible interior point method for linear semidefinite programs

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