Convergence of some algorithms for convex minimization
From MaRDI portal
Recommendations
- A general approach to convergence properties of some methods for nonsmooth convex optimization
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Quasi-monotone subgradient methods for nonsmooth convex minimization
- Convergence of first-order methods via the convex conjugate
- Convergence analysis of some methods for minimizing a nonsmooth convex function
Cites work
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 125245 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3237318 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A descent algorithm for nonsmooth convex optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex functions, monotone operators and differentiability
- Newton's method for convex programming and Tschebyscheff approximation
- Numerical methods for nondifferentiable convex optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(only showing first 100 items - show all)- Descentwise inexact proximal algorithms for smooth optimization
- A quasi-second-order proximal bundle algorithm
- Fast proximal algorithms for nonsmooth convex optimization
- A modified conjugate gradient method for general convex functions
- A bundle method for solving equilibrium problems
- Efficiency of proximal bundle methods
- Solving generation expansion planning problems with environmental constraints by a bundle method
- A proximal approach to the inversion of ill-conditioned matrices
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Computing proximal points of nonconvex functions
- Cutting plane oracles to minimize non-smooth non-convex functions
- First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing
- The convergence rate of the sandwich algorithm for approximating convex functions
- Convergence analysis of gradient descent stochastic algorithms
- Variable metric bundle methods: From conceptual to implementable forms
- A decomposition method for convex minimization problems and its application.
- On the proximal gradient algorithm with alternated inertia
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Computing proximal points of convex functions with inexact subgradients
- An inertial algorithm for DC programming
- A subgradient method with non-monotone line search
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- An approximate decomposition algorithm for convex minimization
- Convergence of the approximate auxiliary problem method for solving generalized variational inequalities
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- A decomposition algorithm for convex nondifferentiable minimization with errors
- Composite proximal bundle method
- Lagrangean/surrogate relaxation for generalized assignment problems
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Convergence for stabilisation of degenerately convex minimisation problems
- Some convergence properties of descent methods
- Two ``well-known properties of subgradient optimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- An inexact proximal point method for solving generalized fractional programs
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- Convergence analysis of a proximal newton method1
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- Coupling the proximal point algorithm with approximation methods
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- A new trust region algorithm for nonsmooth convex minimization
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Minimizing and stationary sequences of convex constrained minimization problems
- 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
- Approximations in proximal bundle methods and decomposition of convex programs
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- First-order methods of smooth convex optimization with inexact oracle
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Sample-path optimization of convex stochastic performance functions
- Globally convergent BFGS method for nonsmooth convex optimization
- Subgradient algorithm on Riemannian manifolds
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- A doubly stabilized bundle method for nonsmooth convex optimization
- A convergence analysis for a convex version of Dikin's algorithm
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Convergence of Minimal Sets in Convex Vector Optimization
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- An inexact bundle variant suited to column generation
- Algorithms for quasiconvex minimization
- A family of variable metric proximal methods
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Projection Methods in Conic Optimization
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Subgradient methods for saddle-point problems
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- A quasi-Newton bundle method based on approximate subgradients
- A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm
- A note on locally Lipschitzian functions
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Nonsmooth optimization by successive abs-linearization in function spaces
- First order methods for optimization on Riemannian manifolds
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- Approximate subgradient methods for Lagrangian relaxations on networks
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Incremental bundle methods using upper models
- Nesterov perturbations and projection methods applied to IMRT
- Distributed optimization with inexact oracle
- Principled analyses and design of first-order methods with inexact proximal operators
- Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- Weak convexity and approximate subdifferentials
- Convergence of first-order methods via the convex conjugate
- Nonsmooth nonconvex global optimization in a Banach space with a basis
- An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
- A simple version of bundle method with linear programming
- scientific article; zbMATH DE number 1208852 (Why is no real title available?)
- On convergence of minimization methods: Attraction, repulsion, and selection
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- scientific article; zbMATH DE number 3930256 (Why is no real title available?)
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
- Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature
This page was built for publication: Convergence of some algorithms for convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321649)
