Essentials of numerical nonsmooth optimization
From MaRDI portal
Publication:5970841
DOI10.1007/s10288-019-00425-xzbMath1442.90143OpenAlexW2993689585MaRDI QIDQ5970841
Giovanni Giallombardo, Manlio Gaudioso, Giovanna Miglionico
Publication date: 21 April 2020
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-019-00425-x
Related Items
A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem ⋮ 4OR comes of age. Editorial note ⋮ Essentials of numerical nonsmooth optimization
Uses Software
Cites Work
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Generalized Bundle Methods
- Survey of Bundle Methods for Nonsmooth Optimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- Convex analysis and global optimization
- Solving convex programs by random walks
- A proximal bundle method based on approximate subgradients
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Optimizing sensor cover energy via DC programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- A doubly stabilized bundle method for nonsmooth convex optimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Universal gradient methods for convex optimization problems
- Diagonal bundle method for nonsmooth sparse optimization
- Dynamic smoothness parameter for fast gradient methods
- A smooth method for the finite minimax problem
- On solving the Lagrangian dual of integer programs via an incremental approach
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A bundle modification strategy for convex minimization
- A partially inexact bundle method for convex semi-infinite minmax problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm
- A polynomial Newton method for linear programming
- Newton's method for convex programming and Tschebyscheff approximation
- Global optimality conditions for nonconvex optimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- A bundle Bregman proximal method for convex nondifferentiable minimization
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- A trust region algorithm for minimization of locally Lipschitzian functions
- A Cholesky dual method for proximal piecewise linear programming
- Variable metric bundle methods: From conceptual to implementable forms
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Smooth transformation of the generalized minimax problem
- Nondifferentiable optimization and polynomial problems
- The volume algorithm revisited: relation with bundle methods
- Globally convergent BFGS method for nonsmooth convex optimization
- The volume algorithm: Producing primal solutions with a subgradient method
- A method for convex minimization based on translated first-order approximations
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A family of variable metric proximal methods
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A descent proximal level bundle method for convex nondifferentiable optimization
- A quasi-second-order proximal bundle algorithm
- New variants of bundle methods
- Complexity estimates of some cutting plane methods based on the analytic barrier
- A science fiction story in nonsmooth optimization originating at IIASA
- Classification in the multiple instance learning framework via spherical separation
- Methods of descent for nondifferentiable optimization
- Proximal bundle methods for nonsmooth DC programming
- A class on nonmonotone stabilization methods in unconstrained optimization
- Superlinearly convergent algorithm for min-max problems
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A nonsmooth version of Newton's method
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A \(\mathcal{VU}\)-algorithm for convex minimization
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
- Lectures on Modern Convex Optimization
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Introduction to Nonsmooth Optimization
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- Piecewise-quadratic Approximations in Convex Numerical Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
- A descent algorithm for nonsmooth convex optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- The Speed of Shor's R-algorithm
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- Optimization and nonsmooth analysis
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- Two-Point Step Size Gradient Methods
- Combined lp and quasi-Newton methods for minimax 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
- Quadratic Approximations in Convex Nondifferentiable Optimization
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A central cutting plane algorithm for the convex programming problem
- Finding the nearest point in A polytope
- Monotone Operators and the Proximal Point Algorithm
- On convergence rates of subgradient optimization methods
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Minmaxmin problems revisited
- A Spectral Bundle Method for Semidefinite Programming
