Algorithms for some minimax problems
From MaRDI portal
Publication:2533707
Cites work
- An Abstract Variational Theory with Applications to a Broad Class of Optimization Problems. II. Applications
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3230811 (Why is no real title available?)
- scientific article; zbMATH DE number 3234930 (Why is no real title available?)
- scientific article; zbMATH DE number 3270342 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3313232 (Why is no real title available?)
- scientific article; zbMATH DE number 3358258 (Why is no real title available?)
- Linear Optimal Control Problems
- Nonlinear Programming: A Numerical Survey
- The Cutting-Plane Method for Solving Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Cited in
(34)- Layout of facilities with some fixed points
- Improving feasible directions for a class of nondifferentiable functions
- 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 finite steepest-ascent algorithm for maximizing piecewise-linear concave functions
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- On the rate of convergence of two minimax algorithms
- Theorems of the alternative and duality
- Spherical minimax location problem using the Euclidean norm: Formulation and optimization
- Optimally distributed products
- A heuristic algorithm for minimax sensor location in the plane
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- 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
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- Asignacion de recuerdos max-min: Propiedades y algoritmos
- The steepest-ascent method for the linear programming problem
- A Primal Approach to the Simple Plant Location Problem
- Optimization of lipschitz continuous functions
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- Extension of optimality conditions via supporting functions
- Note on an extension of “Davidon” methods to nondifferentiable functions
- Continuous approximations to generalized jacobians
- On the circle closest to a set of points
- Optimization of upper semidifferentiable functions
This page was built for publication: Algorithms for some minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2533707)
