Subgradient method with feasible inexact projections for constrained convex optimization problems

DOI10.1080/02331934.2021.1902520zbMath1506.90203arXiv2006.08770OpenAlexW3139355264MaRDI QIDQ5045169

L. F. Prudente, A. A. Aguiar, Orizon P. Ferreira

Publication date: 4 November 2022

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.08770

zbMATH Keywords

subgradient methodconstrained convex optimizationfeasible inexact projection

Mathematics Subject Classification ID

Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

On the inexact scaled gradient projection method ⋮ Convergence of quasi-Newton methods for solving constrained generalized equations

Uses Software

• ALGENCAN

Cites Work

• Subgradient methods for huge-scale optimization problems
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
• Convergence of a simple subgradient level method
• Convergence of some algorithms for convex minimization
• Linear programming: foundations and extensions
• Introductory lectures on convex optimization. A basic course.
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• 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
• The effect of deterministic noise in subgradient methods
• Methods of descent for nondifferentiable optimization
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Conditional Gradient Sliding for Convex Optimization
• Accelerated and Inexact Forward-Backward Algorithms
• Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
• Simplified versions of the conditional gradient method
• Full convergence of the steepest descent method with inexact line searches
• A Subgradient Method for Vector Optimization Problems
• Practical Augmented Lagrangian Methods for Constrained Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Subgradient method with feasible inexact projections for constrained convex optimization problems