On Quadratic Programming

Cited In (56)

Existence and sensitivity analysis for nonconvex cubic optimization problems
An exact quadratic programming approach based on convex reformulation for seru scheduling problems
A quadratic simplex algorithm for primal optimization over zero-one polytopes
A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints
Risk-Averse Models in Bilevel Stochastic Linear Programming
Variable fixing method by weighted average for the continuous quadratic knapsack problem
A representation of generalized convex polyhedra and applications
An a posteriori decision support methodology for solving the multi-criteria supplier selection problem
Generalized polyhedral convex optimization problems
Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality
On the solution existence and stability of quadratically constrained nonconvex quadratic programs
Quadratic programming problems and related linear complementarity problems
A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
The fundamental theorem of linear programming: extensions and applications
On the pervasiveness of difference-convexity in optimization and statistics
Block pivot methods for solving the complementarity problem
A generalization of the Frank—Wolfe theorem
Bilevel Linear Optimization Under Uncertainty
Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs
On the solution existence and stability of polynomial optimization problems
A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
Copositive-plus Lemke algorithm solves polymatrix games
Linear complementarity problems and multiple objective programming
Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
A finite improvement algorithm for the linear complementarity problem
Properties of two DC algorithms in quadratic programming
An alternative method for a global analysis of quadratic programs in a finite number of steps
A simplicial approximation of a solution for the nonlinear complementarity problem
An LPCC approach to nonconvex quadratic programs
On solvability of convex noncoercive quadratic programming problems
Continuity of the solution map in quadratic programs under linear perturbations
Piecewise linear retractions by reflexion
Order-based error for managing ensembles of surrogates in mesh adaptive direct search
Set intersection theorems and existence of optimal solutions
Solution existence and stability of quadratically constrained convex quadratic programs
Quantitative stability of mixed-integer two-stage quadratic stochastic programs
Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs
More results on the convergence of iterative methods for the symmetric linear complementarity problem
Optimum design of plastic structures under displacement constraints
On the convergence of iterative methods for symmetric linear complementarity problems
On the complexity of quadratic programming in real number models of computation
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
Two-stage parallel iterative methods for the symmetric linear complementarity problem
Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems
Conjugate cone characterization of positive definite and semidefinite matrices
On the solution existence of nonconvex quadratic programming problems in Hilbert spaces
On a Frank-Wolfe type theorem in cubic optimization
Error bounds and strong upper semicontinuity for monotone affine variational inequalities
The basic theorem of complementarity revisited
On convex quadratic programs with linear complementarity constraints
Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming
On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
Title not available (Why is that?)
Error bounds for solutions of linear equations and inequalities
Some aspects of studying an optimization or decision problem in different computational models

This page was built for publication: On Quadratic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5653804)