Pages that link to "Item:Q3026765"
From MaRDI portal
The following pages link to Iterative Methods for Large Convex Quadratic Programs: A Survey (Q3026765):
Displayed 46 items.
- On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
- NE/SQP: A robust algorithm for the nonlinear complementarity problem (Q689133) (← links)
- A scalable computational platform for particulate Stokes suspensions (Q781989) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- A note on a quadratic formulation for linear complementarity problems (Q1090251) (← links)
- Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models (Q1118531) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs (Q1195287) (← links)
- Two-stage parallel iterative methods for the symmetric linear complementarity problem (Q1201951) (← links)
- An inexact NE/SQP method for solving the nonlinear complementarity problem (Q1202586) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Augmented Lagrangian algorithms for linear programming (Q1321268) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- Remarks on the numerical solution of certain linear complementarity problems (Q1372128) (← links)
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks. (Q1406626) (← links)
- MINQ8: general definite and bound constrained indefinite quadratic programming (Q1744884) (← links)
- A numerical algorithm for hydrodynamic free boundary problems (Q1802296) (← links)
- Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results (Q1803603) (← links)
- Computational schemes for large-scale problems in extended linear- quadratic programming (Q1813335) (← links)
- Splitting methods for constrained quadratic programs in data analysis (Q1816645) (← links)
- An inexact algorithm for composite nondifferentiable optimization (Q1823153) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Iterative schemes for the least 2-norm solution of piecewise linear programs (Q1902107) (← links)
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
- On the solution of concave knapsack problems (Q2276878) (← links)
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
- Application of the dual active set algorithm to quadratic network optimization (Q2366828) (← links)
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution (Q2424763) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- Boundary variational formulations and numerical solution techniques for unilateral contact problems (Q2640382) (← links)
- A differentiable exact penalty function for bound constrained quadratic programming problems (Q3362090) (← links)
- (Q3388753) (← links)
- Novel approaches to the discrimination problem (Q4031377) (← links)
- Convergence of a projected gradient method with trust region for nonlinear constrained optimization† (Q4327888) (← links)
- The trust region subproblem and semidefinite programming* (Q4673323) (← links)