A barrier function method for minimax problems
From MaRDI portal
Publication:1186276
DOI10.1007/BF01586049zbMath0749.90081MaRDI QIDQ1186276
J. E. Higgins, Elijah Polak, David Q. Mayne
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Existence of solutions for minimax problems (49J35) Semi-infinite programming (90C34) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities, An efficient algorithm for solving semi-infinite inequality problems with box constraints, An entropic regularized method of centers for continuous minimax problem with semi infinite constraints, Fuzzy adaptive switching control for an uncertain robot manipulators with time-varying output constraint, Algorithms with adaptive smoothing for finite minimax problems, Unnamed Item, Unnamed Item, A dual algorithm for minimax problems, Solving continuous min-max problems by an iterative entropic regularization method., A new non-monotone SQP algorithm for the minimax problem, Preface, An aggregate homotopy method for solving unconstrained minimax problems, Moving horizon control of linear systems with input saturation and plant uncertainty Part 1. Robustness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- A new polynomial-time algorithm for linear programming
- A quadratically convergent algorithm for solving infinite dimensional inequalities
- An algorithm for composite nonsmooth optimization problems
- A comparative study of several semi-infinite nonlinear programming algorithms
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- A recursive quadratic programming algorithm for semi-infinite optimization problems
- Rates of convergence for a method of centers algorithm
- Minimization of functions having Lipschitz continuous first partial derivatives
- A method of feasible directions using function approximations, with applications to min max problems
- A projected lagrangian algorithm for semi-infinite programming
- Optimization and nonsmooth analysis
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- An exact penalty function for semi-infinite programming
- On the design of stabilizing compensators via semi-infinite optimization
- An improved algorithm for optimization problems with functional inequality constraints
- Variable metric methods for minimizing a class of nondifferentiable functions
- Combined lp and quasi-Newton methods for minimax optimization
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- An algorithm for optimization problems with functional inequality constraints
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- An Efficient Method to Solve the Minimax Problem Directly
- Trajectory analysis and extrapolation in barrier function methods
- The Sequential Unconstrained Minimization Technique (SUMT) Without Parameters
