Pages that link to "Item:Q2533707"
From MaRDI portal
The following pages link to Algorithms for some minimax problems (Q2533707):
Displaying 34 items.
- Optimization of upper semidifferentiable functions (Q790713) (← links)
- Layout of facilities with some fixed points (Q1086124) (← links)
- Improving feasible directions for a class of nondifferentiable functions (Q1099079) (← links)
- Reflections on nondifferentiable optimization. I: Ball gradient (Q1131956) (← links)
- An algorithm for the minimization of convex non differentiable functionals in Hilbert space (Q1142997) (← links)
- A globally convergent, implementable multiplier method with automatic penalty limitation (Q1145623) (← links)
- A globally convergent algorithm for exact penalty functions (Q1149884) (← links)
- New convergence theorems for a class of feasible directions algorithms (Q1151828) (← links)
- An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
- A finite steepest-ascent algorithm for maximizing piecewise-linear concave functions (Q1240155) (← links)
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review (Q1312749) (← links)
- On the rate of convergence of two minimax algorithms (Q1321092) (← links)
- Theorems of the alternative and duality (Q1369042) (← links)
- Spherical minimax location problem using the Euclidean norm: Formulation and optimization (Q1804377) (← links)
- Optimally distributed products (Q1844593) (← links)
- A heuristic algorithm for minimax sensor location in the plane (Q2370328) (← links)
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian (Q2494475) (← links)
- On the maximization of a certain nondifferentiable function (Q2537896) (← links)
- Optimal piecewise constant control of continuous time systems with time- varying delay (Q2542642) (← links)
- On the solution of some max-min problems (Q2551310) (← links)
- An algorithm for minimax parameter optimization (Q2559662) (← links)
- On the cones of tangents with applications to mathematical programming (Q2560095) (← links)
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
- Asignacion de recuerdos max-min: Propiedades y algoritmos (Q3354440) (← links)
- The steepest-ascent method for the linear programming problem (Q3932598) (← links)
- A Primal Approach to the Simple Plant Location Problem (Q3958238) (← links)
- Optimization of lipschitz continuous functions (Q4177351) (← links)
- Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
- Extension of optimality conditions via supporting functions (Q4770221) (← links)
- Note on an extension of “Davidon” methods to nondifferentiable functions (Q4777068) (← links)
- Continuous approximations to generalized jacobians (Q4944357) (← links)
- On the circle closest to a set of points (Q5959387) (← links)