Linearly constrained minimax optimization

DOI10.1007/BF01588966MaRDI QIDQ4154015zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
• Generalized Gradients and Applications
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm

Cited in

(37)

• Variable metric methods for linearly constrained nonlinear minimax approximation
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• Minimax linear programming problem
• An algorithm for separable nonlinear minimax problems
• An algorithm for the minimization of convex non differentiable functionals in Hilbert space
• Discrete minimax problem: Algorithms and numerical comparisons
• An algorithm for convex constrained minimax optimization based on duality
• An algorithm for solving linearly constrained minimax problems
• On the convergence of a class of nonlinear approximation methods
• A lexicographic minimax algorithm for multiperiod resource allocation
• Min-max optimization of several classical discrete optimization problems
• The balanced linear programming problem
• On the rate of convergence of two minimax algorithms
• Nonmonotone line search for minimax problems
• Relaxation-based algorithms for minimax optimization problems with resource allocation applications
• Corrected sequential linear programming for sparse minimax optimization
• Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation
• Superlinearly convergent algorithm for min-max problems
• A proximal-projection partial bundle method for convex constrained minimax problems
• An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
• scientific article; zbMATH DE number 3880447 (Why is no real title available?)
• MINIMAX APPROACH TO THE OPTIMAL SHAPE DESIGN OF ELECTROMAGNETIC DEVICES
• A hybrid algorithm for linearly constrained minimax problems
• scientific article; zbMATH DE number 3956831 (Why is no real title available?)
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• Optimization of electrical circuits
• Combined lp and quasi-Newton methods for minimax optimization
• A smoothing-out technique for min—max optimization
• ε-Optimal solutions in nondifferentiable convex programming and some related questions
• A quasi-newton method for minimum trace factor analysis
• A generalized neural network for solving a class of minimax optimization problems with linear constraints
• An extension of the Fletcher-Reeves method to linear equality constrained optimization problem
• A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
• SOME ASPECTS OF OPTIMUM DESIGN OF ELECTROMAGNETIC DEVICES
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
• Algorithms with adaptive smoothing for finite minimax problems
• A note on the regularization of discrete approximation problems

This page was built for publication: Linearly constrained minimax optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154015)