On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
From MaRDI portal
Publication:1290597
DOI10.1007/BF01584842zbMath0919.90122OpenAlexW2061657011MaRDI QIDQ1290597
Mikhail V. Solodov, Ya. I. Al'ber, Alfredo Noel Iusem
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584842
nonsmooth optimizationweak convergenceHilbert spaceconvergence rateprojected gradient methodconstrained convex optimizationsteepest descent method
Related Items
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions, A new self-adaptive CQ algorithm with an application to the LASSO problem, A proximal point method for quasi-equilibrium problems in Hilbert spaces, Subgradient method with feasible inexact projections for constrained convex optimization problems, Subgradient algorithms for solving variable inequalities, A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces, Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces, Learning Multiple Quantiles With Neural Networks, Continuous gradient projection method in Hilbert spaces, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, A subgradient method for multiobjective optimization on Riemannian manifolds, The approximation algorithm for solving a sort of non-smooth programming, Modified basic projection methods for a class of equilibrium problems, A direct splitting method for nonsmooth variational inequalities, Primal-dual \(\varepsilon\)-subgradient method for distributed optimization, A computational study of a class of recursive inequalities, A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models, Self-adaptive gradient projection algorithms for variational inequalities involving non-Lipschitz continuous operators, Projected subgradient method for non-Lipschitz set-valued mixed variational inequalities, Subgradient method for convex feasibility on Riemannian manifolds, Convergence of the projection and contraction methods for solving bilevel variational inequality problems, An additive subfamily of enlargements of a maximally monotone operator, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., The extragradient method for solving variational inequalities in the presence of computational errors, A projection subgradient method for solving optimization with variational inequality constraints, An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians, Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space, An infeasible-point subgradient method using adaptive approximate projections, A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method, A subgradient-like algorithm for solving vector convex inequalities, Finite termination of inexact proximal point algorithms in Hilbert spaces, Nonlocal $p$-Laplacian Evolution Problems on Graphs, A weighting subgradient algorithm for multiobjective optimization, A relaxed projection method for solving multiobjective optimization problems, An incremental subgradient method on Riemannian manifolds, A projected subgradient method for solving generalized mixed variational inequalities, Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces, Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality, A viscosity method with no spectral radius requirements for the split common fixed point problem, Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems, Nonsmooth nonconvex global optimization in a Banach space with a basis, Convergence of direct methods for paramonotone variational inequalities, Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints, Iterative thresholding meets free-discontinuity problems, Convergence of a projected gradient method variant for quasiconvex objectives, Modified Fejér sequences and applications, Convex Cardinal Shape Composition, Accelerated projected gradient method for linear inverse problems with sparsity constraints, Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization, A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems, Level bundle-like algorithms for convex optimization, Auxiliary principle and iterative algorithms for Lions-Stampacchia variational inequalities, Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization, Scaling Techniques for $\epsilon$-Subgradient Methods, Path-based incremental target level algorithm on Riemannian manifolds, Error stability properties of generalized gradient-type algorithms, Projected Stochastic Gradients for Convex Constrained Problems in Hilbert Spaces, Adapted total variation for artifact free decompression of JPEG images, Two-stage stochastic variational inequality arising from stochastic programming, An interior projected-like subgradient method for mixed variational inequalities, Distributed optimization with inexact oracle
Cites Work
- Error stability properties of generalized gradient-type algorithms
- Convergence of some algorithms for convex minimization
- Convergence of the steepest descent method for minimizing quasiconvex functions
- The stabilizing properties of the gradient method
- Entropy-Like Proximal Methods in Convex Programming
- Full convergence of the steepest descent method with inexact line searches
- On the Subdifferentiability of Convex Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
