Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
From MaRDI portal
Publication:5162654
DOI10.1137/20M1378089zbMath1489.90214arXiv2011.01283OpenAlexW3209398125MaRDI QIDQ5162654
Matt Menickelly, Jeffrey Larson, Baoyu Zhou
Publication date: 5 November 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.01283
Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items
Uses Software
Cites Work
- Unnamed Item
- On Lipschitz optimization based on gray-box piecewise linearization
- Subgradient method for nonconvex nonsmooth optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- An algorithm for composite nonsmooth optimization problems
- A trust region algorithm for minimization of locally Lipschitzian functions
- A property of piecewise smooth functions
- A derivative-free trust-region algorithm for composite nonsmooth optimization
- A geometric integration approach to nonsmooth, nonconvex optimisation
- Derivative-free robust optimization by outer approximations
- Stochastic subgradient method converges on tame functions
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
- First- and second-order optimality conditions for piecewise smooth objective functions
- An adaptive gradient sampling algorithm for non-smooth optimization
- Introduction to Piecewise Differentiable Equations
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Adjoint Mode Computation of Subgradients for McCormick Relaxations
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Evaluating an element of the Clarke generalized Jacobian of a composite piecewise differentiable function
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Computing a Trust Region Step
- A vector forward mode of automatic differentiation for generalized derivative evaluation
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Clarke Subgradients of Stratifiable Functions
- McCormick-Based Relaxations of Algorithms
- Introduction to Derivative-Free Optimization
- An Invitation to Tame Optimization
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A model algorithm for composite nondifferentiable optimization problems
- Minimization of Locally Lipschitzian Functions
- Variational Analysis
- Trust Region Methods
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- Derivative-Free and Blackbox Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Survey of Bundle Methods for Nonsmooth Optimization
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems
- Benchmarking Derivative-Free Optimization Algorithms
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions
- Derivative-free optimization methods
- Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Manifold Sampling for $\ell_1$ Nonconvex Optimization
- Approximating Subdifferentials by Random Sampling of Gradients
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
This page was built for publication: Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions
