An interior point algorithm for convex quadratic programming with strict equilibrium constraints

DOI10.1051/ro:2005002zbMath1102.90041OpenAlexW2732500872MaRDI QIDQ5710540

Rachid Benouahboun, Abdelatif Mansouri

Publication date: 2 December 2005

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

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

zbMATH Keywords

Newton's methodinterior point algorithmConvex quadratic programming with a strict equilibrium constraints

Mathematics Subject Classification ID

Convex programming (90C25) Quadratic programming (90C20) Methods of quasi-Newton type (90C53) Interior-point methods (90C51)

Cites Work

• An algorithm for optimizing over the weakly-efficient set
• Interior path following primal-dual algorithms. I: Linear programming
• A quadratic programming approach for certain classes of non linear structural problems
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• Optimal design of beams discretized by elastic plastic finite element
• Path-Following Methods for Linear Programming
• Mathematical Programs with Equilibrium Constraints
• Optimization over the efficient set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item