Inexact spectral projected gradient methods on convex sets

DOI10.1093/imanum/23.4.539zbMath1047.65042OpenAlexW2000218110MaRDI QIDQ4460568

Marcos Raydan, Ernesto G. Birgin, José Mario Martínez

Publication date: 18 May 2004

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/23.4.539

zbMATH Keywords

convergence numerical results least-squares nonmonotone line search Dykstra's algorithm projected gradient alternating projection method spectral gradient large-scale convex constrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06)

Related Items

A matrix-free trust-region Newton algorithm for convex-constrained optimization, Inexact restoration for derivative-free expensive function minimization and applications, Inexact variable metric method for convex-constrained optimization problems, Global sensitivity analysis based on high-dimensional sparse surrogate construction, Convergence properties of inexact projected gradient methods, Accelerating gradient projection methods for $\ell _1$-constrained signal recovery by steplength selection rules, An iteration method to solve multiple constrained least squares problems, Hybrid spectral gradient method for the unconstrained minimization problem, A trust region spectral method for large-scale systems of nonlinear equations, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, Second-order negative-curvature methods for box-constrained and general constrained optimization, LMBOPT: a limited memory method for bound-constrained optimization, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Gradient methods with adaptive step-sizes, Constrained optimization with integer and continuous variables using inexact restoration and projected gradients, Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, New convergence results for the inexact variable metric forward-backward method, Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization, Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, Nonmonotone algorithm for minimization on closed sets with applications to minimization on Stiefel manifolds, Inexact restoration method for minimization problems arising in electronic structure calculations, A gradient method exploiting the two dimensional quadratic termination property, A new steplength selection for scaled gradient methods with application to image deblurring, Construction of quantum states with special properties by projection methods, A multivariate spectral projected gradient method for bound constrained optimization, Fast projections onto mixed-norm balls with applications, Analysis of a variable metric block coordinate method under proximal errors, Application of the restrained optimal perturbation method to study the backward heat conduction problem, A cyclic projected gradient method, A projected-gradient interior-point algorithm for complementarity problems, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Inexact gradient projection method with relative error tolerance, Optimal non-negative forecast reconciliation, On the natural merit function for solving complementarity problems, Using a spectral scaling structured BFGS method for constrained nonlinear least squares, Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope, Improving ultimate convergence of an augmented Lagrangian method, Efficient projected gradient methods for cardinality constrained optimization, A derivative-free nonmonotone line-search technique for unconstrained optimization, A cyclic block coordinate descent method with generalized gradient projections, A new generalized shrinkage conjugate gradient method for sparse recovery, Solving bound constrained optimization via a new nonmonotone spectral projected gradient method, A Barzilai-Borwein type method for minimizing composite functions, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, On Regularization and Active-set Methods with Complexity for Constrained Optimization, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, A Kronecker approximation with a convex constrained optimization method for blind image restoration, Convex constrained optimization for large-scale generalized Sylvester equations, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, On the low rank solution of the Q‐weighted nearest correlation matrix problem, Steplength selection in gradient projection methods for box-constrained quadratic programs, Inexact proximal $\epsilon$-subgradient methods for composite convex optimization problems, A new line search inexact restoration approach for nonlinear programming, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Convergence properties of nonmonotone spectral projected gradient methods, Convergence Properties of a Second Order Augmented Lagrangian Method for Mathematical Programs with Complementarity Constraints, Exact spectral-like gradient method for distributed optimization, Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm, On efficiency of nonmonotone Armijo-type line searches, Quasi-Newton acceleration for equality-constrained minimization, Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, A projected gradient method for optimization over density matrices, Spectral residual method without gradient information for solving large-scale nonlinear systems of equations, A Variable Metric Forward-Backward Method with Extrapolation, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Numerical Methods for $Q$-Weighted Nonnegative Matrix Tri-Factorization, On large-scale unconstrained optimization and arbitrary regularization, On the inexact scaled gradient projection method, A family of spectral gradient methods for optimization, Impulse noise removal by an adaptive trust-region method, Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems, Spectral gradient methods for linearly constrained optimization, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, A flexible inexact-restoration method for constrained optimization, A non-monotonic method for large-scale non-negative least squares, Scaling techniques for gradient projection-type methods in astronomical image deblurring

Uses Software

SPG