An Efficient Method to Solve the Minimax Problem Directly
From MaRDI portal
Cited in
(65)- Residual Selection in A Projection Method for Convex Minimization Problems
- A smoothing trust-region Newton-CG method for minimax problem
- Robust min-max portfolio strategies for rival forecast and risk scenarios
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
- Band structure optimization of two-dimensional photonic crystals in \(H\)-polarization
- A QP-free algorithm for finite minimax problems
- A note on ‘new algorithms for constrained minimax optimization’
- Combined lp and quasi-Newton methods for minimax optimization
- 3D finite element meshing from imaging data
- An algorithm for composite nonsmooth optimization problems
- The optimization technique for solving a class of non-differentiable programming based on neural network method
- A superlinearly convergent constrained min-max algorithm for rival models of the same system
- Computation of generalized H 2 optimal controllers
- A hybrid algorithm for nonlinear minimax problems
- Superlinearly convergent algorithm for min-max problems
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- A new algorithm for minimax andl1-norm optimization
- A regularization strategy for discontinuity when modelling coupled water and heat flow in freezing unsaturated soil
- Algorithms with adaptive smoothing for finite minimax problems
- Surface smoothing and quality improvement of quadrilateral/hexahedral meshes with geometric flow
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions
- Yield design theory: An efficient static method formulation
- Optimization of electrical circuits
- Solving fuzzy variational inequalities over a compact set
- A lower bound for the controlling parameters of the exact penalty functions
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Solving min-max problems and linear semi-infinite programs
- An -active barrier-function method for solving minimax problems
- An aggregate homotopy method for solving unconstrained minimax problems
- An algorithm for convex constrained minimax optimization based on duality
- Neural network for constrained nonsmooth optimization using Tikhonov regularization
- scientific article; zbMATH DE number 1143749 (Why is no real title available?)
- On the entropic regularization method for solving min-max problems with applications
- Unification of basic and composite nondifferentiable optimization
- Discrete minimax problem: Algorithms and numerical comparisons
- A new objective penalty function approach for solving constrained minimax problems
- Nonmonotone line search for minimax problems
- Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software
- New limited memory bundle method for large-scale nonsmooth optimization
- Solving implicit mathematical programs with fuzzy variational inequality constraints based on the method of centres with entropic regularization
- Solving mathematical programs with fuzzy equilibrium constraints
- A relaxed cutting plane algorithm for solving fuzzy inequality systems
- Composite nonsmooth optimization using approximate generalized gradient vectors
- An inertial Hestenes-Stiefel algorithm for nonsmooth convex optimization and its applications in machine learning
- Adaptive and quality quadrilateral/hexahedral meshing from volumetric data
- MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization
- Steplength algorithms for minimizing a class of nondifferentiable functions
- An adaptive smoothing method for continuous minimax problems
- Solving variational inequalities in a fuzzy environment
- Nondifferentiable optimization via smooth approximation: General analytical approach
- A hybrid algorithm for linearly constrained minimax problems
- A method for convex black-box integer global optimization
- A smoothing iterative method for the finite minimax problem
- Parameter estimation in models generated by SDEs with symmetric alpha-stable noise
- A smooth method for the finite minimax problem
- A projected conjugate gradient method for sparse minimax problems
- A smoothing three-term conjugate gradient method for solving finite minimax problems
- A barrier function method for minimax problems
- Inexact smoothing method for large scale minimax optimization
- A class of algorithms for large scale nonlinear minimax optimization
- An algorithm for the minimax Weber problem
- A constrained min-max algorithm for rival models of the same economic system
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- New minimax algorithm
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
This page was built for publication: An Efficient Method to Solve the Minimax Problem Directly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4164738)
