Composite proximal bundle method
From MaRDI portal
Recommendations
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- A proximal method for composite minimization
- A doubly stabilized bundle method for nonsmooth convex optimization
- On a Class of Nonsmooth Composite Functions
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- A Gauss-Newton method for convex composite optimization
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A proximal method for composite minimization
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A redistributed proximal bundle method for nonconvex optimization
- A second-order bundle method to minimize the maximum eigenvalue function.
- Active Sets, Nonsmoothness, and Sensitivity
- Comparing different nonsmooth minimization methods and software
- Convergence of some algorithms for convex minimization
- Identifying structure of nonsmooth convex functions by the bundle technique
- Incremental-like bundle methods with application to energy planning
- Local properties of algorithms for minimizing nonsmooth composite functions
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonsmooth optimization via quasi-Newton methods
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
- On a Class of Nonsmooth Composite Functions
- On convergence of the Gauss-Newton method for convex composite optimization.
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- Semismooth and Semiconvex Functions in Constrained Optimization
- The 𝒰-Lagrangian of a convex function
- Two numerical methods for optimizing matrix stability
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(27)- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Nonsmooth optimization method for \(H_\infty\) output feedback control
- The multiproximal linearization method for convex composite problems
- A proximal method for composite minimization
- Incremental bundle methods using upper models
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Computing proximal points of convex functions with inexact subgradients
- scientific article; zbMATH DE number 7733428 (Why is no real title available?)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Non-smooth optimization for robust control of infinite-dimensional systems
- A proximal bundle method with exact penalty technique and bundle modification strategy for nonconvex nonsmooth constrained optimization
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Subgradient algorithms on Riemannian manifolds of lower bounded curvatures
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Nonsmooth optimization via quasi-Newton methods
- On a Class of Nonsmooth Composite Functions
- Bundle method for non-convex minimization with inexact subgradients and function values
- A doubly stabilized bundle method for nonsmooth convex optimization
- Harnessing Structure in Composite Nonsmooth Minimization
This page was built for publication: Composite proximal bundle method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359623)
