The following pages link to On Quadratic Programming (Q5653804):
Displaying 50 items.
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Properties of two DC algorithms in quadratic programming (Q628748) (← links)
- Linear complementarity problems and multiple objective programming (Q689137) (← links)
- Solution existence and stability of quadratically constrained convex quadratic programs (Q691471) (← links)
- Continuity of the optimal value function and optimal solutions of parametric mixed-integer quadratic programs (Q716528) (← links)
- On the solution existence and stability of quadratically constrained nonconvex quadratic programs (Q723498) (← links)
- Conjugate cone characterization of positive definite and semidefinite matrices (Q787230) (← links)
- Continuity of the solution map in quadratic programs under linear perturbations (Q868535) (← links)
- Set intersection theorems and existence of optimal solutions (Q879966) (← links)
- Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs (Q902395) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- On solvability of convex noncoercive quadratic programming problems (Q1039373) (← links)
- More results on the convergence of iterative methods for the symmetric linear complementarity problem (Q1061019) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- Quadratic programming problems and related linear complementarity problems (Q1121791) (← links)
- Optimum design of plastic structures under displacement constraints (Q1152983) (← links)
- Copositive-plus Lemke algorithm solves polymatrix games (Q1180832) (← links)
- Two-stage parallel iterative methods for the symmetric linear complementarity problem (Q1201951) (← links)
- Block pivot methods for solving the complementarity problem (Q1253090) (← links)
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities (Q1312768) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- On the solution existence of nonconvex quadratic programming problems in Hilbert spaces (Q1696189) (← links)
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search (Q1704921) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- The basic theorem of complementarity revisited (Q1803604) (← links)
- A finite improvement algorithm for the linear complementarity problem (Q1823161) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Quantitative stability of mixed-integer two-stage quadratic stochastic programs (Q1935928) (← links)
- An a posteriori decision support methodology for solving the multi-criteria supplier selection problem (Q1991156) (← links)
- Generalized polyhedral convex optimization problems (Q2010093) (← links)
- A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities (Q2025289) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- On the solution existence and stability of polynomial optimization problems (Q2136888) (← links)
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints (Q2248753) (← links)
- Piecewise linear retractions by reflexion (Q2265339) (← links)
- Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming (Q2267663) (← links)
- On the convergence of iterative methods for symmetric linear complementarity problems (Q2366607) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181) (← links)
- Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems (Q2663382) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)
- Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality (Q3321843) (← links)
- A generalization of the Frank—Wolfe theorem (Q3867558) (← links)
- A simplicial approximation of a solution for the nonlinear complementarity problem (Q4132271) (← links)
- An alternative method for a global analysis of quadratic programs in a finite number of steps (Q4171874) (← links)
- On a Frank-Wolfe type theorem in cubic optimization (Q4634164) (← links)
- Error bounds for solutions of linear equations and inequalities (Q4837939) (← links)
- Bilevel Linear Optimization Under Uncertainty (Q5014639) (← links)
- (Q5026419) (← links)
