A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
From MaRDI portal
Publication:4673325
DOI10.1080/10556780410001648112zbMath1211.90182OpenAlexW2158617645MaRDI QIDQ4673325
Giovanni Giallombardo, Manlio Gaudioso, Antonio Fuduli
Publication date: 29 April 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780410001648112
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Comparing different nonsmooth minimization methods and software, Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization, Tuning strategy for the proximity parameter in convex minimization, A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Piecewise linear approximations in nonconvex nonsmooth optimization, Subgradient method for nonconvex nonsmooth optimization, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, A bundle modification strategy for convex minimization, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, A gradient sampling algorithm for stratified maps with applications to topological data analysis, An effective nonsmooth optimization algorithm for locally Lipschitz functions, Generalized order-value optimization, New diagonal bundle method for clustering problems in large data sets, The semiproximal SVM approach for multiple instance learning: a kernel-based computational study, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization, Constrained nonconvex nonsmooth optimization via proximal bundle method, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, Aggregate subgradient method for nonsmooth DC optimization, An adaptive competitive penalty method for nonsmooth constrained optimization, A fast gradient and function sampling method for finite-max functions, Globally convergent cutting plane method for nonconvex nonsmooth minimization, Codifferential method for minimizing nonsmooth DC functions, Nonsmooth optimization: Theory and algorithms, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, Proximal bundle methods for nonsmooth DC programming, Minimizing Piecewise-Concave Functions Over Polyhedra, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, A splitting bundle approach for non-smooth non-convex minimization, Weak subgradient method for solving nonsmooth nonconvex optimization problems, Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods, Aggregate codifferential method for nonsmooth DC optimization, Nonsmooth bundle trust-region algorithm with applications to robust stability
Cites Work
- Unnamed Item
- Unnamed Item
- Newton's method for convex programming and Tschebyscheff approximation
- An aggregate subgradient method for nonsmooth convex minimization
- Optimization and nonsmooth analysis
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- An Algorithm for Constrained Optimization with Semismooth Functions
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization