Logarithmic barrier function method for convex quadric programming problem

zbMATH Open1163.90692MaRDI QIDQ3620486FDOQ3620486

Authors:

Publication date: 14 April 2009

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

zbMATH Keywords

quadratic programmingconvergenceNewton methodlogarithmic barrier function

Mathematics Subject Classification ID

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

Cited In (8)

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

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)