A bundle modification strategy for convex minimization
From MaRDI portal
Publication:869143
DOI10.1016/J.EJOR.2006.04.005zbMath1114.90090OpenAlexW1989459802MaRDI QIDQ869143
Antonio Fuduli, Alexey V. Demyanov, Giovanna Miglionico
Publication date: 26 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.04.005
Related Items (12)
A method for convex minimization based on translated first-order approximations ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ Unnamed Item ⋮ A feasible point method with bundle modification for nonsmooth convex constrained optimization ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Essentials of numerical nonsmooth optimization ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ A maximum-margin multisphere approach for binary multiple instance learning ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Essentials of numerical nonsmooth optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Newton's method for convex programming and Tschebyscheff approximation
- A bundle Bregman proximal method for convex nondifferentiable minimization
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- 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
- Efficiency of proximal bundle methods
- A family of variable metric proximal methods
- A descent proximal level bundle method for convex nondifferentiable optimization
- A quasi-second-order proximal bundle algorithm
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- An aggregate subgradient method for nonsmooth convex minimization
- The Cutting-Plane Method for Solving Convex Programs
- A descent algorithm for nonsmooth convex optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- The 𝒰-Lagrangian of a convex function
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Generalized Bundle Methods
- Survey of Bundle Methods for Nonsmooth Optimization
This page was built for publication: A bundle modification strategy for convex minimization
