A derivative-free approximate gradient sampling algorithm for finite minimax problems
From MaRDI portal
Recommendations
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Derivative-free optimization methods for finite minimax problems
- Derivative-free robust optimization by outer approximations
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Pattern search methods for finite minimax problems
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 3568371 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 1301898 (Why is no real title available?)
- scientific article; zbMATH DE number 1301900 (Why is no real title available?)
- scientific article; zbMATH DE number 852532 (Why is no real title available?)
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A computational framework for derivative-free optimization of cardiovascular geometries
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A smooth method for the finite minimax problem
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Algorithms with adaptive smoothing for finite minimax problems
- Approximating Subdifferentials by Random Sampling of Gradients
- Benchmarking optimization software with performance profiles.
- Convex analysis and monotone operator theory in Hilbert spaces
- Derivative-free optimization methods for finite minimax problems
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Hybrid genetic algorithms and artificial neural networks for complex design optimization in CFD
- Introduction to Derivative-Free Optimization
- Minimax control design for nonlinear systems based on genetic programming: Jung's collective unconscious approach
- Numerical Optimization
- Optimization of lipschitz continuous functions
- Portfolio optimization under a minimax rule
- Smooth Optimization Methods for Minimax Problems
- Smoothed analysis of \(\kappa(A)\)
- Smoothing method for minimax problems
- The Minimization of Semicontinuous Functions: Mollifier Subgradients
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Using simplex gradients of nonsmooth functions in direct search methods
- Variational Analysis
Cited in
(32)- Full-low evaluation methods for derivative-free optimization
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
- Manifold sampling for \(\ell_1\) nonconvex optimization
- Optimizing damper connectors for adjacent buildings
- A proximal-projection partial bundle method for convex constrained minimax problems
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- A discussion on variational analysis in derivative-free optimization
- Derivative-free robust optimization for circuit design
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- Derivative-free optimization methods
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- On the differentiability check in gradient sampling methods
- Computing proximal points of convex functions with inexact subgradients
- A survey of nonlinear robust optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- A QP-free algorithm for finite minimax problems
- Derivative-free robust optimization by outer approximations
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Compositions of convex functions and fully linear models
- Algorithmic construction of the subdifferential from directional derivatives
- On Lipschitz optimization based on gray-box piecewise linearization
- A convergence analysis of the method of codifferential descent
- A derivative-free comirror algorithm for convex optimization
- Substitute derivatives in unconstrained optimization: A comparison of finite difference and response surface approximations
- Derivative-free optimization methods for finite minimax problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- Numerical analysis of \(\mathcal{VU}\)-decomposition, \(\mathcal{U}\)-gradient, and \(\mathcal{U}\)-Hessian approximations
- A globally convergent QP-free algorithm for inequality constrained minimax optimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
This page was built for publication: A derivative-free approximate gradient sampling algorithm for finite minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360384)
