Newton-KKT interior-point methods for indefinite quadratic programming
type: Item
instance of: scholarly article
title: Newton-KKT interior-point methods for indefinite quadratic programming
zbMATH Open document ID: 1278.90288
published in: Computational Optimization and Applications
publication date: 2007-06-14T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5164794
zbMATH Keywords: interior-point algorithms
zbMATH Keywords: primal-dual algorithms
zbMATH Keywords: Newton-KKT
author: P.-A. Absil
author: André L. Tits
describes a project that uses: JDQR
describes a project that uses: NewtonKKTqp
describes a project that uses: JDQZ
MaRDI profile type: Publication
full work available at URL: s10589-006-8717-1
OpenAlex ID: W2142690901
cites work: A truncated-CG style method for symmetric generalized eigenvalue problems
cites work: The trust region affine interior point algorithm for convex and nonconvex quadratic programming
cites work: Templates for the Solution of Algebraic Eigenvalue Problems
cites work: A trust region method based on interior point techniques for nonlinear programming.
cites work: A Trust Region Interior Point Algorithm for Linearly Constrained Optimization
cites work: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
cites work: Trust Region Methods
cites work: An interior Newton method for quadratic programming
cites work: Q5583564
cites work: A barrier function method for the nonconvex quadratic programming problem with box constraints
cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming
cites work: Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
cites work: Interior Methods for Nonlinear Optimization
cites work: Q3840106
cites work: A general class of penalty/barrier path-following Newton methods for nonlinear programming
cites work: A two-stage feasible directions algorithm for nonlinear constrained optimization
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: Algorithms for bound constrained quadratic programming problems
cites work: Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
cites work: Numerical Optimization
cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
cites work: A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
cites work: Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
cites work: A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
cites work: On some interior-point algorithms for nonconvex quadratic optimization
cites work: Q4311922
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
cites work: A globally convergent primal-dual interior point method for constrained optimization
cites work: On affine scaling algorithms for nonconvex quadratic programming
cites work: On the complexity of approximating a KKT point of quadratic programming
cites work: A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming
DOI: 10.1007/S10589-006-8717-1
Recommended article: Q3170689
Recommended article: An interior Newton method for quadratic programming
Recommended article: Q4625521
Recommended article: Quasi-Newton approaches to interior point methods for quadratic problems
Recommended article: On the Newton interior-point method for nonlinear programming problems
Recommended article: A quasi-Newton interior point method for semi-infinite programming
Recommended article: Q4016641
Recommended article: Q5441043
Recommended article: An infeasible interior-point algorithm for convex quadratic programming with full-Newton step
Recommended article: Q3397535
description: scientific article; zbMATH DE number 5164794