Une caractérisation complete des minima locaux en programmation quadratique
From MaRDI portal
Publication:1134002
DOI10.1007/BF01396705zbMath0422.90061OpenAlexW391646181MaRDI QIDQ1134002
Publication date: 1980
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132675
Related Items (21)
A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs ⋮ A study of piecewise linear-quadratic programs ⋮ Properties of two DC algorithms in quadratic programming ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ qpOASES: a parametric active-set algorithm for~quadratic programming ⋮ A sufficient conditions for global quadratic optimization ⋮ Optimality conditions for maximizing a function over a polyhedron ⋮ Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality ⋮ Boundedness of a type of iterative sequences in two-dimensional quadratic programming ⋮ A continuous approch for globally solving linearly constrained quadratic ⋮ On the solution of concave knapsack problems ⋮ Solutions to quadratic minimization problems with box and integer constraints ⋮ Copositivity for second-order optimality conditions in general smooth optimization problems ⋮ A representation of generalized convex polyhedra and applications ⋮ Necessary and sufficient conditions for quadratic minimality ⋮ Narrowing the difficulty gap for the Celis-Dennis-Tapia problem ⋮ Using copositivity for global optimality criteria in concave quadratic programming problems ⋮ Second-order optimality conditions for infinite-dimensional quadratic programs ⋮ Methods for convex and general quadratic programming
Cites Work
This page was built for publication: Une caractérisation complete des minima locaux en programmation quadratique