Pages that link to "Item:Q4924116"

The following pages link to Derivative-free optimization methods for finite minimax problems (Q4924116):

Displaying 12 items.

• A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• Algorithmic construction of the subdifferential from directional derivatives (Q2413566) (← links)
• A nonsmooth program for jamming hard spheres (Q2439485) (← links)
• A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• A survey of nonlinear robust optimization (Q5882395) (← links)
• A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)