Survey of Bundle Methods for Nonsmooth Optimization
From MaRDI portal
Publication:4806340
DOI10.1080/10556780290027828zbMATH Open1050.90027OpenAlexW2022150446WikidataQ110032620 ScholiaQ110032620MaRDI QIDQ4806340FDOQ4806340
Authors: Marko M. Mäkelä 
Publication date: 18 June 2003
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780290027828
Recommendations
Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonsmooth analysis (49J52)
Cites Work
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Title not available (Why is that?)
- Convex Analysis
- A method for the solution of certain non-linear problems in least squares
- On convergence rates of subgradient optimization methods
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Nonlinear multiobjective optimization
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Proximal Minimization Methods with Generalized Bregman Functions
- Title not available (Why is that?)
- Proximity control in bundle methods for convex nondifferentiable minimization
- Variable metric bundle methods: From conceptual to implementable forms
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- A descent proximal level bundle method for convex nondifferentiable optimization
- New variants of bundle methods
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- Title not available (Why is that?)
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- Newton's method for convex programming and Tschebyscheff approximation
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- On constrained optimization problems with nonsmooth cost functionals
- Numerical methods for nondifferentiable convex optimization
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- Efficiency of proximal bundle methods
- Approximations in proximal bundle methods and decomposition of convex programs
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Title not available (Why is that?)
- Penalty-proximal methods in convex programming
- Optimal control of continuous casting by nondifferentiable multiobjective optimization
- Interactive multiobjective optimization system WWW-NIMBUS on the Internet
- Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- New variable-metric algorithms for nondifferentiable optimization problems
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Generalized Hessian Properties of Regularized Nonsmooth Functions
- Optimization of upper semidifferentiable functions
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A bundle Bregman proximal method for convex nondifferentiable minimization
- A constraint linearization method for nondifferentiable convex minimization
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- Algorithms for multicriterion optimization
Cited In (89)
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- Title not available (Why is that?)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Reachability analysis and deterministic global optimization of DAE models
- A new trust region method for nonsmooth nonconvex optimization
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
- Spectral projected subgradient method for nonsmooth convex optimization problems
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- An error estimate for bilateral contact problem with nonmonotone friction between two electroelastic bodies
- Nonsmooth optimization: Theory and algorithms
- Codifferential method for minimizing nonsmooth DC functions
- A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A new achievement scalarizing function based on parameterization in multiobjective optimization
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- Randomized smoothing variance reduction method for large-scale non-smooth convex optimization
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Essentials of numerical nonsmooth optimization
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- A fast gradient and function sampling method for finite-max functions
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
- A convergence analysis of the method of codifferential descent
- Subgradient and bundle methods for nonsmooth optimization
- On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
- A bundle modification strategy for convex minimization
- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
- A partially inexact bundle method for convex semi-infinite minmax problems
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Tuning strategy for the proximity parameter in convex minimization
- An inexact spectral bundle method for convex quadratic semidefinite programming
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- An effective adaptive trust region algorithm for nonsmooth minimization
- Non-smooth predictive control for mechanical transmission systems with backlash-like hysteresis
- Title not available (Why is that?)
- An analytical and numerical approach to a bilateral contact problem with nonmonotone friction
- Comparing different nonsmooth minimization methods and software
- An optimal variant of Kelley's cutting-plane method
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- A splitting bundle approach for non-smooth non-convex minimization
- Nonsmooth exclusion test for finding all solutions of nonlinear equations
- On the computation of an element of Clarke generalized Jacobian for a vector-valued max function
- Title not available (Why is that?)
- Diagonal bundle method for nonsmooth sparse optimization
- Descent algorithm for nonsmooth stochastic multiobjective optimization
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Clusterwise support vector linear regression
- Derivative-free optimization via proximal point methods
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- Unit commitment in oligopolistic markets by nonlinear mixed variable programming
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Title not available (Why is that?)
- A vector forward mode of automatic differentiation for generalized derivative evaluation
- Constructing a subgradient from directional derivatives for functions of two variables
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- A Deep Learning Method for Elliptic Hemivariational Inequalities
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
- Generalized derivatives of computer programs
- A convex approach for NMPC based on second order Volterra series models
- An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
- The method of codifferential descent for convex and global piecewise affine optimization
- Smoothing quadratic regularization method for hemivariational inequalities
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- Lagrangian relaxation for continuous-time optimal control of coupled hydrothermal power systems including storage capacity and a cascade of hydropower systems with time delays
- Direct search nonsmooth constrained optimization via rounded ℓ1 penalty functions
- Title not available (Why is that?)
- A \(\mathcal{VU}\)-point of view of nonsmooth optimization
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- An algorithm using trust region strategy for minimization of a nondifferentiable function
- Essentials of numerical nonsmooth optimization
Uses Software
This page was built for publication: Survey of Bundle Methods for Nonsmooth Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806340)
