Algorithms for some minimax problems
From MaRDI portal
Publication:2533707
DOI10.1016/S0022-0000(68)80034-0zbMath0177.23104MaRDI QIDQ2533707
Publication date: 1968
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Layout of facilities with some fixed points, A heuristic algorithm for minimax sensor location in the plane, Improving feasible directions for a class of nondifferentiable functions, Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function, Theorems of the alternative and duality, Reflections on nondifferentiable optimization. I: Ball gradient, An algorithm for the minimization of convex non differentiable functionals in Hilbert space, A globally convergent, implementable multiplier method with automatic penalty limitation, A globally convergent algorithm for exact penalty functions, New convergence theorems for a class of feasible directions algorithms, An algorithm for solving linearly constrained minimax problems, A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods, On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian, Continuous approximations to generalized jacobians, Asignacion de recuerdos max-min: Propiedades y algoritmos, A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions, On the circle closest to a set of points, An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality, Optimization of lipschitz continuous functions, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Spherical minimax location problem using the Euclidean norm: Formulation and optimization, On the maximization of a certain nondifferentiable function, Optimal piecewise constant control of continuous time systems with time- varying delay, On the solution of some max-min problems, An algorithm for minimax parameter optimization, On the cones of tangents with applications to mathematical programming, The steepest-ascent method for the linear programming problem, Optimally distributed products, Optimization of upper semidifferentiable functions, The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, Extension of optimality conditions via supporting functions, On the rate of convergence of two minimax algorithms, A Primal Approach to the Simple Plant Location Problem, Note on an extension of “Davidon” methods to nondifferentiable functions
Cites Work
- The Cutting-Plane Method for Solving Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Nonlinear Programming: A Numerical Survey
- Linear Optimal Control Problems
- An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. II. Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
