Comparing different nonsmooth minimization methods and software
From MaRDI portal
Publication:2885467
DOI10.1080/10556788.2010.526116zbMath1242.90233OpenAlexW2045581041WikidataQ109595691 ScholiaQ109595691MaRDI QIDQ2885467
No author found.
Publication date: 23 May 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.526116
Related Items (22)
A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator ⋮ Composite proximal bundle method ⋮ A method for convex minimization based on translated first-order approximations ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ An Approximation Scheme for Distributionally Robust Nonlinear Optimization ⋮ A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities ⋮ A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ A convergence analysis of the method of codifferential descent ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of upper semidifferentiable functions
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- New variable-metric algorithms for nondifferentiable optimization problems
- Representations of quasi-Newton matrices and their use in limited memory methods
- An implementation of Shor's \(r\)-algorithm
- A method of truncated codifferential with application to some problems of cluster analysis
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Methods of descent for nondifferentiable optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Synchronous approach in interactive multiobjective optimization
- A quasisecant method for minimizing nonsmooth functions
- Optimization and nonsmooth analysis
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Robust Formulations for Training Multilayer Perceptrons
- Mathematical Programming for Data Mining: Formulations and Challenges
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- New limited memory bundle method for large-scale nonsmooth optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: Comparing different nonsmooth minimization methods and software
