Linearly constrained minimax optimization

DOI10.1007/BF01588966zbMATH Open0375.65034OpenAlexW2063196363WikidataQ97907825 ScholiaQ97907825MaRDI QIDQ4154015FDOQ4154015

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

• Title not available (Why is that?)
• Generalized Gradients and Applications
• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
• Subproblem and Overall Convergence for a Method-of-Centers Algorithm

Cited In (37)

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