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