Full convergence of the steepest descent method with inexact line searches
From MaRDI portal
Publication:4764581
DOI10.1080/02331939508844042zbMath0821.90089OpenAlexW2031344840WikidataQ58048672 ScholiaQ58048672MaRDI QIDQ4764581
L. M. Graña Drummond, Alfredo Noel Iusem, Regina Sandra Burachik, Benar Fux Svaiter
Publication date: 4 May 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844042
Related Items
Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ On inexact projected gradient methods for solving variable vector optimization problems ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ A modified Quasi-Newton method for vector optimization problem ⋮ A subgradient method for multiobjective optimization ⋮ Inexact projected gradient method for vector optimization ⋮ Newton-like methods for efficient solutions in vector optimization ⋮ Enlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifolds ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Descent methods with linesearch in the presence of perturbations ⋮ IQC analysis and synthesis via nonsmooth optimization ⋮ Some convergence properties of descent methods ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ On the convergence of a new hybrid projection algorithm ⋮ On the steplength selection in gradient methods for unconstrained optimization ⋮ The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions ⋮ Inexact gradient projection method with relative error tolerance ⋮ The extragradient method for solving variational inequalities in the presence of computational errors ⋮ A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method ⋮ A steepest descent-like method for variable order vector optimization problems ⋮ Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature ⋮ Full convergence of an approximate projection method for nonsmooth variational inequalities ⋮ First Order Methods for Optimization on Riemannian Manifolds ⋮ The Extragradient Method for Convex Optimization in the Presence of Computational Errors ⋮ Legendre transform and applications to finite and infinite optimization ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ A steepest descent method for vector optimization ⋮ Nonsmooth nonconvex global optimization in a Banach space with a basis ⋮ Convergence of direct methods for paramonotone variational inequalities ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors ⋮ Convex- and monotone-transformable mathematical programming problems and a proximal-like point method ⋮ Double-regularization proximal methods, with complementarity applications ⋮ Convergence of a projected gradient method variant for quasiconvex objectives ⋮ On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ Subgradient algorithm on Riemannian manifolds ⋮ Proximal point algorithm with Schur decomposition on the cone of symmetric semidefinite positive matrices ⋮ Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals ⋮ Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvature ⋮ On perturbed steepest descent methods with inexact line search for bilevel convex optimization ⋮ On the convergence of the projected gradient method for vector optimization ⋮ Algorithms for quasiconvex minimization ⋮ A relaxed projection method for finite-dimensional equilibrium problems ⋮ On the projected subgradient method for nonsmooth convex optimization in a Hilbert space ⋮ An interior point method with Bregman functions for the variational inequality problem with paramonotone operators ⋮ A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces ⋮ Convergence of the steepest descent method for minimizing quasiconvex functions ⋮ Blind deconvolution by a Newton method on the non-unitary hypersphere ⋮ Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems ⋮ Two facts on the convergence of the Cauchy algorithm ⋮ Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization ⋮ Steepest descent methods for critical points in vector optimization problems ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
Cites Work
