On affine scaling algorithms for nonconvex quadratic programming

DOI10.1007/BF01580903zbMath0767.90065OpenAlexW2063549526MaRDI QIDQ1196182

Publication date: 17 December 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580903

zbMATH Keywords

nonconvex quadratic programming NP-hard ellipsoidal constraint interior algorithms affine- scaling algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An extension of interior point potential reduction algorithm to solve general lcps, Multi-standard quadratic optimization: Interior point methods and cone programming reformulation, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, High-Dimensional Learning Under Approximate Sparsity with Applications to Nonsmooth Estimation and Regularized Neural Networks, On piecewise quadratic Newton and trust region problems, A convergence analysis for a convex version of Dikin's algorithm, A potential reduction approach to the frequency assignment problem, Hidden convexity in some nonconvex quadratically constrained quadratic programming, On the complexity of approximating a KKT point of quadratic programming, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Newton-KKT interior-point methods for indefinite quadratic programming, Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions, A trust region affine scaling method for bound constrained optimization, On a solution method in indefinite quadratic programming under linear constraints, Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints, Penalty parameter for linearly constrained 0--1 quadratic programming, An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints, Convexity of quadratic transformations and its use in control and optimization, A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems, Fast semi-supervised evidential clustering, A first-order interior-point method for linearly constrained smooth optimization, Global optimization by canonical dual function, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, Solution to an optimal control problem via canonical dual method, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, A splitting method for quadratic programming problem, A geometric analysis of phase retrieval, A new algorithm for the general quadratic programming problems with box constraints, A study on concave optimization via canonical dual function, Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension, Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid, Tilt stability for quadratic programs with one or two quadratic inequality constraints, Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs

Cites Work