Convergence analysis of some methods for minimizing a nonsmooth convex function
From MaRDI portal
Publication:1265007
DOI10.1023/A:1022630801549zbMath0907.90216OpenAlexW1491680399MaRDI QIDQ1265007
Publication date: 11 February 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022630801549
Related Items
Survey of Bundle Methods for Nonsmooth Optimization ⋮ Multivariate spectral gradient algorithm for nonsmooth convex optimization problems ⋮ A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization ⋮ Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations ⋮ An algorithm for approximating piecewise linear concave functions from sample gradients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Modified proximal point algorithm for extended linear-quadratic programming
- Inexact subgradient methods with applications in stochastic programming
- Convergence of some algorithms for convex minimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- Newton's method for quadratic stochastic programs with recourse
- A quasi-second-order proximal bundle algorithm
- Methods of descent for nondifferentiable optimization
- An aggregate subgradient method for nonsmooth convex minimization
- A descent algorithm for nonsmooth convex optimization
- Epi‐consistency of convex stochastic programs
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- New Proximal Point Algorithms for Convex Minimization
- Imbedded Lattice Rules for Multidimensional Integration
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Numerical methods for nondifferentiable convex optimization
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- Subdifferential Convergence in Stochastic Programs
This page was built for publication: Convergence analysis of some methods for minimizing a nonsmooth convex function
