Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components
From MaRDI portal
Publication:4554066
DOI10.1137/17M114741XzbMath1407.90351OpenAlexW2898428916MaRDI QIDQ4554066
Jeffrey Larson, Stefan M. Wild, Kamil A. Khan
Publication date: 7 November 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m114741x
Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization, A discussion on variational analysis in derivative-free optimization, Derivative-free optimization of a rapid-cycling synchrotron, 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, Derivative-free optimization methods, A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies
Uses Software
Cites Work
- Unnamed Item
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- An algorithm for composite nonsmooth optimization problems
- Compositions of convex functions and fully linear models
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- Introduction to Piecewise Differentiable Equations
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Computing a Trust Region Step
- 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
- Censored Discrete Linear $l_1 $ Approximation
- A model algorithm for composite nondifferentiable optimization problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Benchmarking Derivative-Free Optimization Algorithms
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Manifold Sampling for $\ell_1$ Nonconvex Optimization
