A descent algorithm for nonsmooth convex optimization
From MaRDI portal
Recommendations
Cites work
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- Convex Analysis
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
Cited in
(73)- Greatest descent algorithms in unconstrained optimization
- A method for minimizing the sum of a convex function and a continuously differentiable function
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- Penalty-proximal methods in convex programming
- Constrained gradient method for nonsmooth optimization problems
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- Descent algorithm for a class of convex nondifferentiable functions
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Convergence of some algorithms for convex minimization
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A surrogate heuristic for set covering problems
- Variable metric bundle methods: From conceptual to implementable forms
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Globally convergent BFGS method for nonsmooth convex optimization
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- An effective adaptive trust region algorithm for nonsmooth minimization
- A family of variable metric proximal methods
- An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
- A quasi-second-order proximal bundle algorithm
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Nonsmooth steepest descent method by proximal subdifferentials in Hilbert spaces
- The Mordukhovich subdifferentials and directions of descent
- Tuning strategy for the proximity parameter in convex minimization
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A modified conjugate gradient method for general convex functions
- A method for nonsmooth optimization problems
- An ODE-like nonmonotone method for nonsmooth convex optimization
- A Descent Algorithm for Minimizing Polyhedral Convex Functions
- scientific article; zbMATH DE number 4204134 (Why is no real title available?)
- scientific article; zbMATH DE number 4149901 (Why is no real title available?)
- scientific article; zbMATH DE number 3900525 (Why is no real title available?)
- scientific article; zbMATH DE number 3912124 (Why is no real title available?)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization
- Descent methods for composite nondifferentiable optimization problems
- scientific article; zbMATH DE number 3938461 (Why is no real title available?)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
- scientific article; zbMATH DE number 727769 (Why is no real title available?)
- scientific article; zbMATH DE number 1070384 (Why is no real title available?)
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
- scientific article; zbMATH DE number 2144580 (Why is no real title available?)
- scientific article; zbMATH DE number 6129040 (Why is no real title available?)
- scientific article; zbMATH DE number 7347554 (Why is no real title available?)
- An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Cutting plane algorithms and approximate lower subdifferentiability
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- A generic coordinate descent solver for non-smooth convex optimisation
- Essentials of numerical nonsmooth optimization
- Minimizing and stationary sequences of convex constrained minimization problems
- Essentials of numerical nonsmooth optimization
- Minimizing oracle-structured composite functions
- On a feasible descent algorithm for solving min-max problems
- Abstract generalized epsilon-descent algorithm
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
- Fast proximal algorithms based on Chebychev centers for nonsmooth optimization
- A bundle modification strategy for convex minimization
- A quasi-Newton bundle method based on approximate subgradients
- A partially inexact bundle method for convex semi-infinite minmax problems
- Proximity control in bundle methods for convex nondifferentiable minimization
This page was built for publication: A descent algorithm for nonsmooth convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337229)
