Pages that link to "Item:Q4154015"
From MaRDI portal
The following pages link to Linearly constrained minimax optimization (Q4154015):
Displayed 37 items.
- A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
- A generalized neural network for solving a class of minimax optimization problems with linear constraints (Q433302) (← links)
- An extension of the Fletcher-Reeves method to linear equality constrained optimization problem (Q482439) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A note on the regularization of discrete approximation problems (Q921320) (← links)
- Variable metric methods for linearly constrained nonlinear minimax approximation (Q1051247) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- Minimax linear programming problem (Q1075944) (← links)
- An algorithm for separable nonlinear minimax problems (Q1093547) (← links)
- An algorithm for the minimization of convex non differentiable functionals in Hilbert space (Q1142997) (← links)
- Discrete minimax problem: Algorithms and numerical comparisons (Q1157881) (← links)
- An algorithm for convex constrained minimax optimization based on duality (Q1160889) (← links)
- An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
- On the convergence of a class of nonlinear approximation methods (Q1169786) (← links)
- A lexicographic minimax algorithm for multiperiod resource allocation (Q1196169) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- On the rate of convergence of two minimax algorithms (Q1321092) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation (Q1751057) (← links)
- Superlinearly convergent algorithm for min-max problems (Q2277156) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
- (Q3346095) (← links)
- MINIMAX APPROACH TO THE OPTIMAL SHAPE DESIGN OF ELECTROMAGNETIC DEVICES (Q3495020) (← links)
- (Q3725888) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- Optimization of electrical circuits (Q3858061) (← links)
- Combined lp and quasi-Newton methods for minimax optimization (Q3883931) (← links)
- A smoothing-out technique for min—max optimization (Q3922488) (← links)
- ε-Optimal solutions in nondifferentiable convex programming and some related questions (Q3959749) (← links)
- A quasi-newton method for minimum trace factor analysis (Q4253263) (← links)
- A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints (Q4995612) (← links)
- SOME ASPECTS OF OPTIMUM DESIGN OF ELECTROMAGNETIC DEVICES (Q5288310) (← links)
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)