A weighted path-following method for linearly constrained convex programming

MaRDI QIDQ5396126zbMATH OpenFDO

Authors Zakia Kebbiche, Djamel Benterki

Publication date 5 February 2014

zbMATH Keywords

complexity analysislinearly constrained convex programmingnonlinear programmingprimal-dual interior point methodweighted path-following method

Mathematics Subject Classification ID

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

Recommendations

• A weighted logarithmic barrier interior-point method for linearly constrained optimization
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• scientific article; zbMATH DE number 4183197
• Weighted-path-following algorithm for linear programming
• A weighted-path-following method for symmetric cone linear complementarity problems

Cited in

(10)

• Novel interior point algorithms for solving nonlinear convex optimization problems
• Several path-following methods for a class of gradient constrained variational inequalities
• A feasible primal-dual interior point method for linear semidefinite programming
• A Polynomial Method of Weighted Centers for Convex Quadratic Programming
• Path-Following Methods for Linear Programming
• Path following in the exact penalty method of convex programming
• A weighted logarithmic barrier interior-point method for linearly constrained optimization
• A single-phase, proximal path-following framework
• A weighted-path-following method for linear optimization
• Weighted-path-following algorithm for linear programming

This page was built for publication: A weighted path-following 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 Q5396126)