SDMINMAX

swMATH36992MaRDI QIDQ52694FDOQ52694

Author name not available (Why is that?)

Described by source

• A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems

Cited In (11)

• Derivative-free robust optimization for circuit design
• Direct Gravitational Search Algorithm for Global Optimisation Problems
• A derivative-free approximate gradient sampling algorithm for finite minimax problems
• A proximal-projection partial bundle method for convex constrained minimax problems
• An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming
• A homotopy method based on penalty function for nonlinear semidefinite programming
• A penalty derivative-free algorithm for nonlinear constrained optimization
• Unit commitment in oligopolistic markets by nonlinear mixed variable programming
• A nonlinear augmented Lagrangian for constrained minimax problems
• A derivative-free algorithm for systems of nonlinear inequalities
• Derivative-free optimization methods

This page was built for software: SDMINMAX