Manifold Sampling for $\ell_1$ Nonconvex Optimization
From MaRDI portal
Publication:5506685
DOI10.1137/15M1042097zbMath1351.90167OpenAlexW2559335683MaRDI QIDQ5506685
Stefan M. Wild, Jeffrey Larson, Matt Menickelly
Publication date: 13 December 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1042097
Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items (11)
A discussion on variational analysis in derivative-free optimization ⋮ Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components ⋮ Compositions of convex functions and fully linear models ⋮ Derivative-free optimization of a rapid-cycling synchrotron ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ Tuning Multigrid Methods with Robust Optimization and Local Fourier Analysis ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions ⋮ Derivative-free robust optimization by outer approximations ⋮ Monotonic grey box direct search optimization ⋮ Derivative-free optimization methods
Uses Software
Cites Work
- Unnamed Item
- Stochastic derivative-free optimization using a trust region framework
- On Lipschitz optimization based on gray-box piecewise linearization
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- Methods of descent for nondifferentiable optimization
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- Global Convergence of Radial Basis Function Trust-Region Algorithms for Derivative-Free Optimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Introduction to Derivative-Free Optimization
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Optimization and nonsmooth analysis
- Descent methods for composite nondifferentiable optimization problems
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A model algorithm for composite nondifferentiable optimization problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Benchmarking Derivative-Free Optimization Algorithms
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
This page was built for publication: Manifold Sampling for $\ell_1$ Nonconvex Optimization
