Une caractérisation complete des minima locaux en programmation quadratique

From MaRDI portal
Publication:1134002

DOI10.1007/BF01396705zbMath0422.90061OpenAlexW391646181MaRDI QIDQ1134002

Louis Contesse B.

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 OptimizationNecessary and sufficient condition for local minima of a class of nonconvex quadratic programsA study of piecewise linear-quadratic programsProperties of two DC algorithms in quadratic programmingCopositive optimization -- recent developments and applicationsThink co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimizationqpOASES: a parametric active-set algorithm for~quadratic programmingA sufficient conditions for global quadratic optimizationOptimality conditions for maximizing a function over a polyhedronCharacterization of Positive Definite and Semide Finite Matrices via Quadratic Programming DualityBoundedness of a type of iterative sequences in two-dimensional quadratic programmingA continuous approch for globally solving linearly constrained quadraticOn the solution of concave knapsack problemsSolutions to quadratic minimization problems with box and integer constraintsCopositivity for second-order optimality conditions in general smooth optimization problemsA representation of generalized convex polyhedra and applicationsNecessary and sufficient conditions for quadratic minimalityNarrowing the difficulty gap for the Celis-Dennis-Tapia problemUsing copositivity for global optimality criteria in concave quadratic programming problemsSecond-order optimality conditions for infinite-dimensional quadratic programsMethods for convex and general quadratic programming



Cites Work


This page was built for publication: Une caractérisation complete des minima locaux en programmation quadratique