The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
type: Item
instance of: scholarly article
title: The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
zbMATH Open document ID: 1482.90135
author: Lukáš Pospíšil
author: Z. Dostál
published in: Mathematics and Computers in Simulation
publication date: 2021-03-01T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 74M15
zbMATH DE Number: 7316167
zbMATH Keywords: quadratic programming
zbMATH Keywords: separable constraints
zbMATH Keywords: QCQP
zbMATH Keywords: Barzilai-Borwein with fall-back
describes a project that uses: SPG
MaRDI profile type: Publication
full work available at URL: j.matcom.2017.10.003
OpenAlex ID: W2766258225
cites work: Two-Point Step Size Gradient Methods
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q3151174
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Algorithm 813
cites work: On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
cites work: Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
cites work: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: On the decrease of a quadratic function along the projected-gradient path
cites work: Optimal quadratic programming algorithms. With applications to variational inequalities
cites work: An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
cites work: Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Convex Programming with Separable Ellipsoidal Constraints: Application in Contact Problems with Orthotropic Friction
cites work: Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
cites work: The R-linear convergence rate of an algorithm arising from the semi-smooth Newton method applied to 2D contact problems with friction
cites work: Q4324980
cites work: A nonlinear programming approach to the unilateral contact-, and friction-boundary value problem in the theory of elasticity
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
cites work: Variationally consistent discretization schemes and numerical algorithms for contact problems
DOI: 10.1016/J.MATCOM.2017.10.003
Recommended article: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Recommended article: A new projected Barzilai-Borwein method for the symmetric cone complementarity problem
Recommended article: Q3346104
Recommended article: A projection and contraction method for convex quadratic programming
Recommended article: Q3617894
Recommended article: Barrier-projective methods for nonlinear programming
Recommended article: A modified projection algorithm for large strictly-convex quadratic programs
Recommended article: Q3104291
Recommended article: A projected Barzilai-Borwein method for a class of stochastic linear complementarity problems
Recommended article: On a conjugate directions method for solving strictly convex QP problem
description: scientific article; zbMATH DE number 7316167