An Efficient Method to Solve the Minimax Problem Directly

DOI10.1137/0715011zbMath0384.65032OpenAlexW2159686234MaRDI QIDQ4164738

Andrew R. Conn, Christakis Charalambous

Publication date: 1978

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/917f6a897b981593e73f5e89082a7b71c6bbcb6d

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items (61)

A class of algorithms for large scale nonlinear minimax optimization ⋮ A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities ⋮ Unnamed Item ⋮ A relaxed cutting plane algorithm for solving fuzzy inequality systems ⋮ Adaptive and quality quadrilateral/hexahedral meshing from volumetric data ⋮ New limited memory bundle method for large-scale nonsmooth optimization ⋮ A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ On the entropic regularization method for solving min-max problems with applications ⋮ The optimization technique for solving a class of non-differentiable programming based on neural network method ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ A superlinearly convergent constrained min-max algorithm for rival models of the same system ⋮ Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software ⋮ Computation of generalized H ₂ optimal controllers ⋮ Unification of basic and composite nondifferentiable optimization ⋮ Neural network for constrained nonsmooth optimization using Tikhonov regularization ⋮ Parameter estimation in models generated by SDEs with symmetric alpha-stable noise ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ Steplength algorithms for minimizing a class of nondifferentiable functions ⋮ An algorithm for the minimax Weber problem ⋮ Inexact smoothing method for large scale minimax optimization ⋮ Discrete minimax problem: Algorithms and numerical comparisons ⋮ An algorithm for convex constrained minimax optimization based on duality ⋮ A QP-free algorithm for finite minimax problems ⋮ A smoothing trust-region Newton-CG method for minimax problem ⋮ Band structure optimization of two-dimensional photonic crystals in \(H\)-polarization ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ A constrained min-max algorithm for rival models of the same economic system ⋮ A barrier function method for minimax problems ⋮ A smooth method for the finite minimax problem ⋮ Nondifferentiable optimization via smooth approximation: General analytical approach ⋮ Solving fuzzy variational inequalities over a compact set ⋮ Acceleration of the leastpth algorithm for minimax optimization with engineering applications ⋮ Solving mathematical programs with fuzzy equilibrium constraints ⋮ Optimization of electrical circuits ⋮ 3D finite element meshing from imaging data ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Superlinearly convergent algorithm for min-max problems ⋮ A new algorithm for minimax andl₁-norm optimization ⋮ Surface smoothing and quality improvement of quadrilateral/hexahedral meshes with geometric flow ⋮ Composite nonsmooth optimization using approximate generalized gradient vectors ⋮ Residual Selection in A Projection Method for Convex Minimization Problems ⋮ Solving implicit mathematical programs with fuzzy variational inequality constraints based on the method of centres with entropic regularization ⋮ A note on ‘new algorithms for constrained minimax optimization’ ⋮ Combined lp and quasi-Newton methods for minimax optimization ⋮ A method for convex black-box integer global optimization ⋮ A lower bound for the controlling parameters of the exact penalty functions ⋮ A smoothing iterative method for the finite minimax problem ⋮ Solving min-max problems and linear semi-infinite programs ⋮ Yield design theory: An efficient static method formulation ⋮ On the generalization of ECP and OA methods to nonsmooth convex MINLP problems ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ Robust min-max portfolio strategies for rival forecast and risk scenarios ⋮ Solving variational inequalities in a fuzzy environment ⋮ An aggregate homotopy method for solving unconstrained minimax problems ⋮ An algorithm for composite nonsmooth optimization problems ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions ⋮ A projected conjugate gradient method for sparse minimax problems ⋮ An \(\epsilon\)-active barrier-function method for solving minimax problems ⋮ New minimax algorithm ⋮ Nonmonotone line search for minimax problems

This page was built for publication: An Efficient Method to Solve the Minimax Problem Directly