Linearly constrained minimax optimization

DOI10.1007/BF01588966zbMath0375.65034OpenAlexW2063196363WikidataQ97907825 ScholiaQ97907825MaRDI QIDQ4154015

Kaj Madsen, Hans Schjaer-Jacobsen

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588966

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (37)

Minimax linear programming problem ⋮ A quasi-newton method for minimum trace factor analysis ⋮ Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ SOME ASPECTS OF OPTIMUM DESIGN OF ELECTROMAGNETIC DEVICES ⋮ Corrected sequential linear programming for sparse minimax optimization ⋮ An algorithm for separable nonlinear minimax problems ⋮ A method of linearizations for linearly constrained nonconvex nonsmooth minimization ⋮ A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ Unnamed Item ⋮ MINIMAX APPROACH TO THE OPTIMAL SHAPE DESIGN OF ELECTROMAGNETIC DEVICES ⋮ An algorithm for the minimization of convex non differentiable functionals in Hilbert space ⋮ A generalized neural network for solving a class of minimax optimization problems with linear constraints ⋮ Discrete minimax problem: Algorithms and numerical comparisons ⋮ An algorithm for convex constrained minimax optimization based on duality ⋮ A note on the regularization of discrete approximation problems ⋮ An algorithm for solving linearly constrained minimax problems ⋮ On the convergence of a class of nonlinear approximation methods ⋮ An extension of the Fletcher-Reeves method to linear equality constrained optimization problem ⋮ A lexicographic minimax algorithm for multiperiod resource allocation ⋮ Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation ⋮ Optimization of electrical circuits ⋮ Superlinearly convergent algorithm for min-max problems ⋮ Unnamed Item ⋮ Combined lp and quasi-Newton methods for minimax optimization ⋮ An implementation of a reduced subgradient method via Luenberger-Mokhtar variant ⋮ Min-max optimization of several classical discrete optimization problems ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ The balanced linear programming problem ⋮ A smoothing-out technique for min—max optimization ⋮ Variable metric methods for linearly constrained nonlinear minimax approximation ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems ⋮ A quadratic approximation method for minimizing a class of quasidifferentiable functions ⋮ On the rate of convergence of two minimax algorithms ⋮ Nonmonotone line search for minimax problems ⋮ ε-Optimal solutions in nondifferentiable convex programming and some related questions

Cites Work

• Unnamed Item
• Generalized Gradients and Applications
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm
• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations

This page was built for publication: Linearly constrained minimax optimization