Newton-KKT interior-point methods for indefinite quadratic programming

DOI10.1007/s10589-006-8717-1zbMath1278.90288OpenAlexW2142690901MaRDI QIDQ885826

André L. Tits, Pierre-Antoine Absil

Publication date: 14 June 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-006-8717-1

zbMATH Keywords

interior-point algorithmsprimal-dual algorithmsNewton-KKT

Mathematics Subject Classification ID

Quadratic programming (90C20) Interior-point methods (90C51)

Related Items

New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, Multi-standard quadratic optimization: Interior point methods and cone programming reformulation, Fitting curves and surfaces to point clouds in the presence of obstacles, Adaptive constraint reduction for convex quadratic programming, An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints, MINQ8: general definite and bound constrained indefinite quadratic programming, Nonlinear optimization problem of interdependent investment projects portfolio, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs

Uses Software

• JDQR
• NewtonKKTqp
• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A truncated-CG style method for symmetric generalized eigenvalue problems
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Algorithms for bound constrained quadratic programming problems
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On affine scaling algorithms for nonconvex quadratic programming
• An interior-point algorithm for nonconvex nonlinear programming
• On the complexity of approximating a KKT point of quadratic programming
• On some interior-point algorithms for nonconvex quadratic optimization
• An interior Newton method for quadratic programming
• Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
• A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
• A two-stage feasible directions algorithm for nonlinear constrained optimization
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
• Numerical Optimization
• A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
• Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
• A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
• A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
• Trust Region Methods
• Templates for the Solution of Algebraic Eigenvalue Problems
• A general class of penalty/barrier path-following Newton methods for nonlinear programming
• Interior Methods for Nonlinear Optimization
• The trust region affine interior point algorithm for convex and nonconvex quadratic programming
• A globally convergent primal-dual interior point method for constrained optimization
• A trust region method based on interior point techniques for nonlinear programming.
• A barrier function method for the nonconvex quadratic programming problem with box constraints