Smoothing method for minimax problems
From MaRDI portal
Publication:5948404
DOI10.1023/A:1011211101714zbMath1054.90087OpenAlexW1494875490MaRDI QIDQ5948404
Publication date: 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011211101714
Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)
Related Items (52)
Unnamed Item ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ On sample size control in sample average approximations for solving smooth stochastic programs ⋮ Pattern search methods for finite minimax problems ⋮ Method of outer approximations and adaptive approximations for a class of matrix games ⋮ A derivative-free approximate gradient sampling algorithm for finite minimax problems ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ On the resolution of certain discrete univariate max-min problems ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ A simplex grey wolf optimizer for solving integer programming and minimax problems ⋮ Substitution secant/finite difference method to large sparse minimax problems ⋮ An aggregate deformation homotopy method for min-max-min problems with max-min constraints ⋮ An image reconstruction algorithm based on the regularized minimax estimation for electrical capacitance tomography ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ Unnamed Item ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ Inexact smoothing method for large scale minimax optimization ⋮ A multi-scale image reconstruction algorithm for electrical capacitance tomography ⋮ Direct Gravitational Search Algorithm for Global Optimisation Problems ⋮ An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A QP-free algorithm for finite minimax problems ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems ⋮ A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems ⋮ A derivative-free algorithm for systems of nonlinear inequalities ⋮ A homotopy method based on penalty function for nonlinear semidefinite programming ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ Memetic particle swarm optimization ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ Unnamed Item ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem ⋮ Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems ⋮ A spline smoothing Newton method for finite minimax problems ⋮ On solving large-scale finite minimax problems using exponential smoothing ⋮ Variable programming: a generalized minimax problem. II: Algorithms ⋮ Recursive approximation of the high dimensional max function ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ A new non-monotone SQP algorithm for the minimax problem ⋮ k -Splittable delay constrained routing problem: A branch-and-price approach ⋮ A smoothing algorithm for finite min-max-min problems ⋮ A smoothing iterative method for the finite minimax problem ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ Hyperbolic smoothing function method for minimax problems ⋮ An active set smoothing method for solving unconstrained minimax problems ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems ⋮ An aggregate homotopy method for solving unconstrained minimax problems
This page was built for publication: Smoothing method for minimax problems
