Convergence analysis of some methods for minimizing a nonsmooth convex function
From MaRDI portal
Recommendations
- A new method for nonsmooth convex optimization
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- A bundle Bregman proximal method for convex nondifferentiable minimization
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 4079168 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 686906 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A descent algorithm for nonsmooth convex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- A quasi-second-order proximal bundle algorithm
- An SQP algorithm for extended linear-quadratic problems in stochastic programming
- An aggregate subgradient method for nonsmooth convex minimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence of some algorithms for convex minimization
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Epi‐consistency of convex stochastic programs
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- Imbedded Lattice Rules for Multidimensional Integration
- Inexact subgradient methods with applications in stochastic programming
- Methods of descent for nondifferentiable optimization
- Modified proximal point algorithm for extended linear-quadratic programming
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- Newton's method for quadratic stochastic programs with recourse
- Numerical methods for nondifferentiable convex optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Proximity control in bundle methods for convex nondifferentiable minimization
- Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Subdifferential Convergence in Stochastic Programs
Cited in
(20)- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems
- On the convergence rate for stochastic approximation in the nonsmooth setting
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Survey of Bundle Methods for Nonsmooth Optimization
- Rate of convergence of the bundle method
- An algorithm for approximating piecewise linear concave functions from sample gradients
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- A method for convex minimization based on translated first-order approximations
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- A convergence analysis result for constrained convex minimization problem
- scientific article; zbMATH DE number 1450255 (Why is no real title available?)
- Convergence analysis of a minimax method for finding multiple solutions of semilinear elliptic equation.: I: On polyhedral domain
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
This page was built for publication: Convergence analysis of some methods for minimizing a nonsmooth convex function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265007)
