Optimality conditions for quadratic programming
From MaRDI portal
Cites work
Cited in
(18)- Une caractérisation complete des minima locaux en programmation quadratique
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Second-order optimality conditions for infinite-dimensional quadratic programs
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- A study of piecewise linear-quadratic programs
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Methods for convex and general quadratic programming
- Copositivity for second-order optimality conditions in general smooth optimization problems
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- Least-index resolution of degeneracy in quadratic programming
- Copositive optimization -- recent developments and applications
- Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- An LPCC approach to nonconvex quadratic programs
- Necessary and sufficient conditions for quadratic minimality
- Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
This page was built for publication: Optimality conditions for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5659348)
