On the complexity of approximating a KKT point of quadratic programming
type: Item
instance of: scholarly article
title: On the complexity of approximating a KKT point of quadratic programming
zbMATH Open document ID: 0894.90117
DOI: 10.1007/BF01581726
author: Yinyu Ye
published in: Mathematical Programming. Series A. Series B
publication date: 1998-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1127719
zbMATH Keywords: quadratic programming
zbMATH Keywords: KKT point
zbMATH Keywords: local minimizer
zbMATH Keywords: potential reduction algorithm
zbMATH Keywords: fully polynomial-time approximation scheme
MaRDI profile type: Publication
cites work: The complexity of approximating a nonlinear program
cites work: Complementary pivot theory of mathematical programming
cites work: Q4198056
cites work: Computing Optimal Locally Constrained Steps
cites work: Q4739659
cites work: Q4209438
cites work: Introduction to global optimization
cites work: How easy is local search?
cites work: A continuous approach to inductive inference
cites work: A new polynomial-time algorithm for linear programming
cites work: A method for the solution of certain non-linear problems in least squares
cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters
cites work: Some NP-complete problems in quadratic and nonlinear programming
cites work: Q4324980
cites work: Constrained global optimization: algorithms and applications
cites work: Complexity of uniqueness and local search in quadratic 0-1 programming
cites work: Checking local optimality in constrained quadratic programming is NP- hard
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: Newton’s Method with a Model Trust Region Modification
cites work: A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem
cites work: Combining binary search and Newton's method to compute real roots for a class of real functions
cites work: On affine scaling algorithms for nonconvex quadratic programming
full work available at URL: https://doi.org/10.1007/bf01581726
OpenAlex ID: W2063676335
description: scientific article; zbMATH DE number 1127719