Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
From MaRDI portal
Publication:1955575
DOI10.1007/s10957-012-0178-3zbMath1266.90137OpenAlexW2031678526MaRDI QIDQ1955575
Jiří Bouchala, Petr Vodstrčil, Zdeněk Dostál
Publication date: 14 June 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0178-3
rate of convergencespherical constraintsEuclidean gradient projectionquadratic programming with separable constraints
Related Items
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints ⋮ On the inexact symmetrized globally convergent semi-smooth Newton method for 3D contact problems with Tresca friction: the R-linear convergence rate ⋮ The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction ⋮ Proportioning with second-order information for model predictive control
Cites Work
- Unnamed Item
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
- On the decrease of a quadratic function along the projected-gradient path
- Scalable total BETI based algorithm for 3D coercive contact problems of linear elastostatics
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Solving the Signorini problem on the basis of domain decomposition techniques
- Error bounds and convergence analysis of feasible descent methods: A general approach
- An algorithm for the numerical realization of 3D contact problems with Coulomb friction.
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- Projected gradient methods for linearly constrained problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Box Constrained Quadratic Programming with Proportioning and Projections
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
