Derivative-free optimization methods for finite minimax problems
From MaRDI portal
Recommendations
- Derivative-free optimization via proximal point methods
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- scientific article; zbMATH DE number 1971709
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Derivative-free optimization methods
Cites work
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A computational framework for derivative-free optimization of cardiovascular geometries
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A proximal method for identifying active manifolds
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Analysis of Generalized Pattern Searches
- Approximating Subdifferentials by Random Sampling of Gradients
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Generating set search methods for piecewise smooth problems
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- scientific article; zbMATH DE number 1301898 (Why is no real title available?)
- Identifiable Surfaces in Constrained Optimization
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- On the Identification of Active Constraints
- Optimization and nonsmooth analysis
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Trailing-edge noise reduction using derivative-free optimization and large-eddy simulation
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Using simplex gradients of nonsmooth functions in direct search methods
Cited in
(25)- Derivative-free optimization via proximal point methods
- A proximal-projection partial bundle method for convex constrained minimax problems
- Derivative-free robust optimization for circuit design
- Algorithmic construction of the subdifferential from directional derivatives
- A nonsmooth program for jamming hard spheres
- Calm minima in parameterized finite-dimensional optimization
- Derivative-Free Optimization
- A derivative-free comirror algorithm for convex optimization
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- scientific article; zbMATH DE number 3920218 (Why is no real title available?)
- Substitution secant/finite difference method to large sparse minimax problems
- scientific article; zbMATH DE number 1971709 (Why is no real title available?)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A Derivative-Free Method for Structured Optimization Problems
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Derivative-free optimization methods
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- On the numerical performance of finite-difference-based methods for derivative-free optimization
- A survey of nonlinear robust optimization
- Wedge trust region method for derivative free optimization.
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- A new algorithm for the minimax location problem with the closest distance
- Survey of derivative-free optimization
- A discussion on variational analysis in derivative-free optimization
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
This page was built for publication: Derivative-free optimization methods for finite minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924116)
