Logarithmic barrier function method for convex quadric programming problem

MaRDI QIDQ3620486zbMATHFDO

Authors

Publication date 14 April 2009

zbMATH Keywords

quadratic programmingconvergenceNewton methodlogarithmic barrier function

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Recommendations

• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
• A long-step barrier method for convex quadratic programming
• scientific article; zbMATH DE number 4193461
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming

Cited in

(10)

• A quasi-Newton penalty barrier method for convex minimization problems
• A long-step barrier method for convex quadratic programming
• A logarithmic barrier function method for solving nonlinear multiobjective programming problems
• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
• Objective function and logarithmic barrier function properties in convex programming: level sets, solution attainment and strict convexity^*
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
• On controlling the parameter in the logarithmic barrier term for convex programming problems
• Higher-order derivatives in linear and quadratic programming
• Log-domain interior-point methods for convex quadratic programming

This page was built for publication: Logarithmic barrier function method for convex quadric programming problem

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