Iterative Methods for Large Convex Quadratic Programs: A Survey
From MaRDI portal
computational studyconvergenceconvex quadratic programsdualityerror boundslinear complementaritymatrix splittingoptimality conditionssurvey
Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- scientific article; zbMATH DE number 1341943
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Splitting and projection-type methods for large convex quadratic programs
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
Cited in
(48)- A note on a quadratic formulation for linear complementarity problems
- Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models
- Algorithms for bound constrained quadratic programming problems
- Implementing proximal point methods for linear programming
- Decomposition algorithm for convex differentiable minimization
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Two-stage parallel iterative methods for the symmetric linear complementarity problem
- An inexact NE/SQP method for solving the nonlinear complementarity problem
- On the dual coordinate ascent approach for nonlinear networks
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Newton's method for linear inequality systems
- Error bounds and convergence analysis of feasible descent methods: A general approach
- 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
- Remarks on the numerical solution of certain linear complementarity problems
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- MINQ8: general definite and bound constrained indefinite quadratic programming
- 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
- An inexact algorithm for composite nondifferentiable optimization
- The adventures of a simple algorithm
- 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
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- On the solution of concave knapsack problems
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Application of the dual active set algorithm to quadratic network optimization
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- A survey on the continuous nonlinear resource allocation problem
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- Boundary variational formulations and numerical solution techniques for unilateral contact problems
- A differentiable exact penalty function for bound constrained quadratic programming problems
- Some aspects of feasibility and solvability for cone linear complementarity problems
- Novel approaches to the discrimination problem
- scientific article; zbMATH DE number 1341943 (Why is no real title available?)
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization†
- The trust region subproblem and semidefinite programming*
- On the linear convergence of the alternating direction method of multipliers
- Novel closed-loop controllers for fractional linear quadratic time-varying systems
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A scalable computational platform for particulate Stokes suspensions
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
This page was built for publication: Iterative Methods for Large Convex Quadratic Programs: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026765)
