An aggregate homotopy method for solving unconstrained minimax problems
From MaRDI portal
Publication:5009167
DOI10.1080/02331934.2020.1751843OpenAlexW3015715472MaRDI QIDQ5009167
Publication date: 19 August 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1751843
Minimax problems in mathematical programming (90C47) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Cites Work
- Unnamed Item
- A spline smoothing Newton method for finite minimax problems
- Algorithms with adaptive smoothing for finite minimax problems
- A smooth method for the finite minimax problem
- A truncated aggregate smoothing Newton method for minimax problems
- Numerical solution of minimax optimal control problems by multiple shooting technique
- A barrier function method for minimax problems
- An aggregate function method for nonlinear programming
- Optimization. Algorithms and consistent approximations
- On the entropic regularization method for solving min-max problems with applications
- Minimax and applications
- Methods of descent for nondifferentiable optimization
- Superlinearly convergent algorithm for min-max problems
- Fitting parametric curves and surfaces by \(l_\infty\) distance regression
- Information Theory and Statistical Mechanics
- The Cutting-Plane Method for Solving Convex Programs
- The Minisum and Minimax Location Problems Revisited
- Variable metric methods for minimizing a class of nondifferentiable functions
- A new algorithm for solution of resistive networks involving diodes
- An Efficient Method to Solve the Minimax Problem Directly
- Introduction to Numerical Continuation Methods
- Smoothing method for minimax problems
This page was built for publication: An aggregate homotopy method for solving unconstrained minimax problems
