Extension of a projective interior point method for linearly constrained convex programming

DOI10.1016/J.AMC.2007.03.066MaRDI QIDQ990634zbMATH OpenOpenAlexFDO

Authors J. Martínez

Publication date 1 September 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2007.03.066

zbMATH Keywords

nonlinear programmingkarmarkar's projective methodlinearization methodslinearly constrained convex programming

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• On some efficient interior point methods for nonlinear convex programming
• On the Complexity of a Class of Projective Interior Point Methods
• Publication:4489281
• An Interior-Point Algorithm for Linearly Constrained Optimization
• scientific article; zbMATH DE number 4119925

Cites work

• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems

Cited in

(9)

• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
• A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
• On convex optimization with linear constraints
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• An extended projective formula and its application to semidefinite optimization
• A logarithmic barrier approach for linear programming
• An experimental approach to karmarkar’s projective method for linear programming
• Projective re-normalization for improving the behavior of a homogeneous conic linear system
• Novel interior point algorithms for solving nonlinear convex optimization problems

This page was built for publication: Extension of a projective interior point method for linearly constrained convex programming

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