An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
DOI10.1137/090751414zbMATH Open1223.65041OpenAlexW1989412488MaRDI QIDQ3083314FDOQ3083314
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090751414
numerical experimentsaugmented Lagrangianconvergence ratequadratic functionoptimal algorithmactive setseparable convex constraintsgradient projectionsminimization error boundsparse Hessian matrix
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)
Cited In (12)
- Qualitative analysis of 3D elastostatic contact problems with orthotropic Coulomb friction and solution-dependent coefficients of friction
- On preconditioning of penalized matrices
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Optimal iterative QP and QPQC algorithms
- Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
- On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate
- An interior-point algorithm for the minimization arising from 3D contact problems with friction
- Approximation and numerical realization of 3D quasistatic contact problems with Coulomb friction
- Engineering Multibody Contact Problems Solved by Scalable TBETI
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems 👍 👎
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination 👍 👎
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications 👍 👎
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints 👍 👎
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum 👍 👎
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions 👍 👎
- An algorithm for global minimization of linearly constrained quadratic functions 👍 👎
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems 👍 👎
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum 👍 👎
This page was built for publication: An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083314)
