Pages that link to "Item:Q360384"
From MaRDI portal
The following pages link to A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384):
Displaying 27 items.
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- Compositions of convex functions and fully linear models (Q1679619) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- A convergence analysis of the method of codifferential descent (Q1756589) (← links)
- A globally convergent QP-free algorithm for inequality constrained minimax optimization (Q2151966) (← links)
- Derivative-free robust optimization by outer approximations (Q2288189) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- Derivative-free robust optimization for circuit design (Q2342134) (← links)
- Optimizing damper connectors for adjacent buildings (Q2357966) (← links)
- Algorithmic construction of the subdifferential from directional derivatives (Q2413566) (← links)
- Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
- A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
- Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components (Q4554066) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Manifold Sampling for $\ell_1$ Nonconvex Optimization (Q5506685) (← links)
- Full-low evaluation methods for derivative-free optimization (Q5882241) (← links)
- A survey of nonlinear robust optimization (Q5882395) (← links)
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
- A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
