Active constraints, indefinite quadratic test problems, and complexity

DOI10.1007/BF00940067zbMath0697.90059MaRDI QIDQ911993

Panos M. Pardalos, H. D. Sahinoglou, William W. Hager, Ioannis M. Roussos

Publication date: 1991

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

zbMATH Keywords

active constraintspolynomial timecomplexity theorynegative eigenvalueslocal minimizerglobal minimizerindefinite quadratic test problemsnearly-concave quadratic minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)

Related Items (11)

Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection ⋮ Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity ⋮ On the construction of test problems for concave minimization algorithms ⋮ On the equivalence between some discrete and continuous optimization problems ⋮ Sparse solutions to random standard quadratic optimization problems ⋮ An LPCC approach to nonconvex quadratic programs ⋮ An outcome space approach for generalized convex multiplicative programs ⋮ A parallel algorithm for partially separable non-convex global minimization: Linear constraints ⋮ A new technique for generating quadratic programming test problems ⋮ The maximum clique problem ⋮ The clique problem for graphs with a few eigenvalues of the same sign

Uses Software

• NAPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definiteness and semidefiniteness of quadratic forms revisited
• An inertia theorem for symmetric matrices and its application to nonlinear programming
• A note on a quadratic formulation for linear complementarity problems
• Constrained global optimization: algorithms and applications
• On inertia and Schur complement in optimization
• Checking local optimality in constrained quadratic programming is NP- hard
• Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
• Generation of large-scale quadratic programs for use as global optimization test problems
• Some NP-complete problems in quadratic and nonlinear programming
• An active method of searching for the global minimum of a concave function

This page was built for publication: Active constraints, indefinite quadratic test problems, and complexity