Algorithms with adaptive smoothing for finite minimax problems

DOI10.1023/B:JOTA.0000006685.60019.3EzbMath1061.90117OpenAlexW2071614767MaRDI QIDQ597184

Sumit K. Garg

Publication date: 6 August 2004

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jota.0000006685.60019.3e

zbMATH Keywords

smoothing techniquesfeedback precision-adjustment ruleFinite minimaxnonsmooth optimization algorithms

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Existence of solutions for minimax problems (49J35)

Related Items (51)

Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions ⋮ Unnamed Item ⋮ A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ 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 ⋮ Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ 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 ⋮ An Approximation Scheme for Distributionally Robust PDE-Constrained Optimization ⋮ Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques ⋮ 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 ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Parameter estimation in models generated by SDEs with symmetric alpha-stable noise ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ Consistent approximations in composite optimization ⋮ Inexact smoothing method for large scale minimax optimization ⋮ An Approximation Scheme for Distributionally Robust Nonlinear Optimization ⋮ Direct Gravitational Search Algorithm for Global Optimisation Problems ⋮ Convergence of an interior point algorithm for continuous minimax ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A QP-free algorithm for finite minimax problems ⋮ A smoothing trust-region Newton-CG method for minimax problem ⋮ Efficient sample sizes in stochastic nonlinear programming ⋮ 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 geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve ⋮ Group update method for sparse minimax problems ⋮ Unnamed Item ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ 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 ⋮ Recursive approximation of the high dimensional max function ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ A smoothing algorithm for finite min-max-min problems ⋮ A smoothing iterative method for the finite minimax problem ⋮ Reference variable methods of solving min-Max optimization problems ⋮ A cut-peak function method for global optimization ⋮ 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 ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems ⋮ Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface ⋮ A spline smoothing Newton method for semi-infinite minimax problems ⋮ Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space ⋮ An aggregate homotopy method for solving unconstrained minimax problems

Uses Software

• Optimization Toolbox
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smooth method for the finite minimax problem
• An \(\epsilon\)-active barrier-function method for solving minimax problems
• Nondifferential optimization via adaptive smoothing
• An algorithm for composite nonsmooth optimization problems
• A barrier function method for minimax problems
• New minimax algorithm
• Nonmonotone line search for minimax problems
• Optimization. Algorithms and consistent approximations
• Superlinearly convergent algorithm for min-max problems
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
• Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
• Smooth Optimization Methods for Minimax Problems
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• Variable metric methods for minimizing a class of nondifferentiable functions
• Combined lp and quasi-Newton methods for minimax optimization
• A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
• A smoothing-out technique for min—max optimization
• A model algorithm for composite nondifferentiable optimization problems
• On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
• A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
• Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
• Linearly constrained minimax optimization
• An Efficient Method to Solve the Minimax Problem Directly
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
• ON THE THEORY OF NON-LINEAR MINIMAX PROBLEMS
• On the rate of convergence of certain methods of centers
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• On logarithmic smoothing of the maximum function
• Smoothing method for minimax problems
• How good can polynomial interpolation on the sphere be?

This page was built for publication: Algorithms with adaptive smoothing for finite minimax problems