A derivative-free approximate gradient sampling algorithm for finite minimax problems
From MaRDI portal
Publication:360384
DOI10.1007/s10589-013-9547-6zbMath1300.90064OpenAlexW2145896656MaRDI QIDQ360384
Publication date: 26 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2429/42200
Minimax problems in mathematical programming (90C47) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Optimizing damper connectors for adjacent buildings, Full-low evaluation methods for derivative-free optimization, A survey of nonlinear robust optimization, Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization, A discussion on variational analysis in derivative-free optimization, On Lipschitz optimization based on gray-box piecewise linearization, A derivative-free comirror algorithm for convex optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A globally convergent QP-free algorithm for inequality constrained minimax optimization, Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components, A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints, Compositions of convex functions and fully linear models, Algorithmic construction of the subdifferential from directional derivatives, Computing proximal points of convex functions with inexact subgradients, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, A QP-free algorithm for finite minimax problems, Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems, A convergence analysis of the method of codifferential descent, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Derivative-free robust optimization by outer approximations, A proximal-projection partial bundle method for convex constrained minimax problems, Derivative-free optimization methods, Manifold Sampling for $\ell_1$ Nonconvex Optimization, Derivative-free robust optimization for circuit design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- A smooth method for the finite minimax problem
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A computational framework for derivative-free optimization of cardiovascular geometries
- Smoothed analysis of \(\kappa(A)\)
- Algorithm 909
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Portfolio Optimization Under a Minimax Rule
- Hybrid genetic algorithms and artificial neural networks for complex design optimization in CFD
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Using simplex gradients of nonsmooth functions in direct search methods
- Introduction to Derivative-Free Optimization
- Smooth Optimization Methods for Minimax Problems
- Optimization of lipschitz continuous functions
- Numerical Optimization
- Variational Analysis
- Minimax control design for nonlinear systems based on genetic programming: Jung's collective unconscious approach
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- The Minimization of Semicontinuous Functions: Mollifier Subgradients
- Derivative-free optimization methods for finite minimax problems
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Approximating Subdifferentials by Random Sampling of Gradients
- Convex analysis and monotone operator theory in Hilbert spaces
- Smoothing method for minimax problems
- Benchmarking optimization software with performance profiles.
