On the inexact scaled gradient projection method
From MaRDI portal
Publication:2070333
DOI10.1007/s10589-021-00331-1zbMath1484.90109arXiv2106.04786OpenAlexW3216569558MaRDI QIDQ2070333
L. F. Prudente, M. Lemes, Orizon P. Ferreira
Publication date: 24 January 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.04786
Nonlinear programming (90C30) Newton-type methods (49M15) Nonsmooth analysis (49J52) Numerical computation of solutions to systems of equations (65H10)
Related Items (3)
Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection ⋮ Inexact gradient projection method with relative error tolerance ⋮ On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- On the convergence properties of the projected gradient method for convex optimization
- Convergence properties of nonmonotone spectral projected gradient methods
- Variable metric quasi-Fejér monotonicity
- Gradient methods with adaptive step-sizes
- Convergence of a projected gradient method variant for quasiconvex objectives
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Newton's method with feasible inexact projections for solving constrained generalized equations
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A generalized worst-case complexity analysis for non-monotone line searches
- Alternating conditional gradient method for convex feasibility problems
- Inexact first-order primal-dual algorithms
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- On the steplength selection in gradient methods for unconstrained optimization
- A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
- Nonmonotone projected gradient methods based on barrier and Euclidean distances
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
- A projected gradient method for optimization over density matrices
- Accelerated and Inexact Forward-Backward Algorithms
- A class of nonmonotone Armijo-type line search method for unconstrained optimization
- An Algorithm for Restricted Least Squares Regression
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- New convergence results for the scaled gradient projection method
- A scaled gradient projection method for constrained image deblurring
- Two-Point Step Size Gradient Methods
- On the Goldstein-Levitin-Polyak gradient projection method
- Gradient Method with Retards and Generalizations
- Linear Matrix Inequalities in System and Control Theory
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the convergence rate of scaled gradient projection method
- On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization
- Optimization Methods for Large-Scale Machine Learning
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Inexact Gradient Projection and Fast Data Driven Compressed Sensing
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Inexact variable metric method for convex-constrained optimization problems
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Inexact primal–dual gradient projection methods for nonlinear optimization on convex set
- Primal and polar approach for computing the symmetric diagonally dominant projection
- Robust Stopping Criteria for Dykstra's Algorithm
- An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression
- On first-order algorithms forl1/nuclear norm minimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Convex programming in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: On the inexact scaled gradient projection method
