Pages that link to "Item:Q5948404"
From MaRDI portal
The following pages link to Smoothing method for minimax problems (Q5948404):
Displayed 45 items.
- Method of outer approximations and adaptive approximations for a class of matrix games (Q328448) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Inexact smoothing method for large scale minimax optimization (Q425468) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
- A homotopy method based on penalty function for nonlinear semidefinite programming (Q496592) (← links)
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems (Q522420) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
- A multi-scale image reconstruction algorithm for electrical capacitance tomography (Q636497) (← links)
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems (Q939107) (← links)
- A derivative-free algorithm for systems of nonlinear inequalities (Q941047) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- A smoothing algorithm for finite min-max-min problems (Q1001326) (← links)
- Error bounds of two smoothing approximations for semi-infinite minimax problems (Q1048250) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems (Q1736744) (← links)
- An image reconstruction algorithm based on the regularized minimax estimation for electrical capacitance tomography (Q1932841) (← links)
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
- A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- On sample size control in sample average approximations for solving smooth stochastic programs (Q2376122) (← links)
- Pattern search methods for finite minimax problems (Q2380874) (← links)
- On the resolution of certain discrete univariate max-min problems (Q2401027) (← links)
- A simplex grey wolf optimizer for solving integer programming and minimax problems (Q2402871) (← links)
- An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
- Memetic particle swarm optimization (Q2468766) (← links)
- Variable programming: a generalized minimax problem. II: Algorithms (Q2488054) (← links)
- Recursive approximation of the high dimensional max function (Q2488194) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- Hyperbolic smoothing function method for minimax problems (Q2841156) (← links)
- <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach (Q3057130) (← links)
- (Q3057247) (← links)
- (Q3552458) (← links)
- A new non-monotone SQP algorithm for the minimax problem (Q5190720) (← links)
- An Adaptive Smoothing Method for Continuous Minimax Problems (Q5245835) (← links)
- Direct Gravitational Search Algorithm for Global Optimisation Problems (Q5372051) (← links)