A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
DOI10.1137/040615821zbMATH Open1131.90074OpenAlexW2039542900MaRDI QIDQ5470232FDOQ5470232
Authors: Stefano Lucidi, Giampaolo Liuzzi, Marco Sciandrone 
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040615821
Recommendations
- A derivative-free algorithm for linearly constrained optimization problems
- Derivative-free optimization methods for finite minimax problems
- A derivative-free algorithm for bound constrained optimization
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Derivative-free algorithm for nonlinear optimization problems with partial-bounded constraints
- A derivative-free method for linearly constrained nonsmooth optimization
- An algorithm for solving linearly constrained minimax problems
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- scientific article
Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Derivative-free methods and methods using generalized derivatives (90C56)
Cited In (24)
- Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing
- A derivative-free comirror algorithm for convex optimization
- A derivative-free algorithm for linearly constrained optimization problems
- Derivative-free robust optimization for circuit design
- Direct Gravitational Search Algorithm for Global Optimisation Problems
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A proximal-projection partial bundle method for convex constrained minimax problems
- Pattern search methods for finite minimax problems
- SDMINMAX
- Derivative-free optimization methods for finite minimax problems
- An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming
- A derivative-free algorithm for bound constrained optimization
- A homotopy method based on penalty function for nonlinear semidefinite programming
- A simplex grey wolf optimizer for solving integer programming and minimax problems
- A penalty derivative-free algorithm for nonlinear constrained optimization
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- A truncated aggregate smoothing Newton method for minimax problems
- Unit commitment in oligopolistic markets by nonlinear mixed variable programming
- Substitution secant/finite difference method to large sparse minimax problems
- A nonlinear augmented Lagrangian for constrained minimax problems
- A derivative-free algorithm for systems of nonlinear inequalities
- Derivative-free optimization methods
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems
This page was built for publication: A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470232)
