The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
From MaRDI portal
Publication:1996996
DOI10.1016/j.matcom.2017.10.003zbMath1482.90135OpenAlexW2766258225MaRDI QIDQ1996996
Publication date: 1 March 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2017.10.003
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Methods of quasi-Newton type (90C53) Contact in solid mechanics (74M15)
Related Items (2)
Using gradient directions to get global convergence of Newton-type methods ⋮ Steplength selection in gradient projection methods for box-constrained quadratic programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- On the decrease of a quadratic function along the projected-gradient path
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
- The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
- Lectures on Modern Convex Optimization
- R-linear convergence of the Barzilai and Borwein gradient method
- Variationally consistent discretization schemes and numerical algorithms for contact problems
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
- Two-Point Step Size Gradient Methods
- A nonlinear programming approach to the unilateral contact-, and friction-boundary value problem in the theory of elasticity
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Nonmonotone Line Search Technique for Newton’s Method
- Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
This page was built for publication: The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints