Iterative Methods for Large Convex Quadratic Programs: A Survey
From MaRDI portal
Publication:3026765
DOI10.1137/0325023zbMath0624.90083OpenAlexW2065554534MaRDI QIDQ3026765
No author found.
Publication date: 1987
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0325023
surveyconvergencelinear complementarityoptimality conditionsdualityerror boundsmatrix splittingcomputational studyconvex quadratic programs
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Application of the dual active set algorithm to quadratic network optimization, A note on a quadratic formulation for linear complementarity problems, Boundary variational formulations and numerical solution techniques for unilateral contact problems, Iterative schemes for the least 2-norm solution of piecewise linear programs, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, Remarks on the numerical solution of certain linear complementarity problems, Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models, Algorithms for bound constrained quadratic programming problems, A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines, Implementing proximal point methods for linear programming, Novel approaches to the discrimination problem, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, Convergence of a projected gradient method with trust region for nonlinear constrained optimization†, Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., Unnamed Item, Decomposition algorithm for convex differentiable minimization, A survey on the continuous nonlinear resource allocation problem, MINQ8: general definite and bound constrained indefinite quadratic programming, Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs, On the linear convergence of the alternating direction method of multipliers, NE/SQP: A robust algorithm for the nonlinear complementarity problem, Two-stage parallel iterative methods for the symmetric linear complementarity problem, An inexact NE/SQP method for solving the nonlinear complementarity problem, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, On the dual coordinate ascent approach for nonlinear networks, The trust region subproblem and semidefinite programming*, On the solution of concave knapsack problems, Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming, A differentiable exact penalty function for bound constrained quadratic programming problems, A numerical algorithm for hydrodynamic free boundary problems, Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results, Computational schemes for large-scale problems in extended linear- quadratic programming, Splitting methods for constrained quadratic programs in data analysis, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, An inexact algorithm for composite nondifferentiable optimization, A scalable computational platform for particulate Stokes suspensions, Newton's method for linear inequality systems, Error bounds and convergence analysis of feasible descent methods: A general approach, The adventures of a simple algorithm, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, Augmented Lagrangian algorithms for linear programming, Gauss-Seidel method for least-distance problems, A unified description of iterative algorithms for traffic equilibria
