Algorithms with adaptive smoothing for finite minimax problems
From MaRDI portal
Recommendations
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- An adaptive smoothing method for continuous minimax problems
- On solving large-scale finite minimax problems using exponential smoothing
- A smoothing algorithm for finite min-max-min problems
- Inexact smoothing method for large scale minimax optimization
Cites work
- scientific article; zbMATH DE number 3815360 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3930735 (Why is no real title available?)
- scientific article; zbMATH DE number 3699673 (Why is no real title available?)
- scientific article; zbMATH DE number 3606405 (Why is no real title available?)
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
- A barrier function method for minimax problems
- A continuous minimax problem for calculating minimum norm polynomial interpolation points on the sphere
- A model algorithm for composite nondifferentiable optimization problems
- A smooth method for the finite minimax problem
- A smoothing-out technique for min—max optimization
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Adaptive control of ARMA plants using worst-case design by semi-infinite 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
- An -active barrier-function method for solving minimax problems
- An algorithm for composite nonsmooth optimization problems
- Combined lp and quasi-Newton methods for minimax optimization
- How good can polynomial interpolation on the sphere be?
- Linearly constrained minimax optimization
- New minimax algorithm
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
- Nondifferential optimization via adaptive smoothing
- Nonmonotone line search for minimax problems
- ON THE THEORY OF NON-LINEAR MINIMAX PROBLEMS
- On logarithmic smoothing of the maximum function
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- On the rate of convergence of certain methods of centers
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Optimization. Algorithms and consistent approximations
- Smooth Optimization Methods for Minimax Problems
- Smoothing method for minimax problems
- Superlinearly convergent algorithm for min-max problems
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(52)- A smoothing trust-region Newton-CG method for minimax problem
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Hyperbolic smoothing function method for minimax problems
- A QP-free algorithm for finite minimax problems
- Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
- Hybrid second order method for orthogonal projection onto parametric curve in \(n\)-dimensional Euclidean space
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- A geometric orthogonal projection strategy for computing the minimum distance between a point and a spatial parametric curve
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- A spline smoothing Newton method for semi-infinite minimax problems
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Primal interior-point method for large sparse minimax optimization
- Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
- On solving large-scale finite minimax problems using exponential smoothing
- Direct Gravitational Search Algorithm for Global Optimisation Problems
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- A new algorithm for the minimax location problem with the closest distance
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- An aggregate homotopy method for solving unconstrained minimax problems
- A new objective penalty function approach for solving constrained minimax problems
- Reference variable methods of solving min-Max optimization problems
- A cut-peak function method for global optimization
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- An adaptive smoothing method for continuous minimax problems
- An active set smoothing method for solving unconstrained minimax problems
- A smoothing algorithm for finite min-max-min problems
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Group update method for sparse minimax problems
- Efficient sample sizes in stochastic nonlinear programming
- A simplex grey wolf optimizer for solving integer programming and minimax problems
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- A smoothing iterative method for the finite minimax problem
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Consistent approximations in composite optimization
- Parameter estimation in models generated by SDEs with symmetric alpha-stable noise
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- An approximation scheme for distributionally robust PDE-constrained optimization
- A truncated aggregate smoothing Newton method for minimax problems
- On sample size control in sample average approximations for solving smooth stochastic programs
- A smoothing three-term conjugate gradient method for solving finite minimax problems
- Substitution secant/finite difference method to large sparse minimax problems
- Recursive approximation of the high dimensional max function
- Inexact smoothing method for large scale minimax optimization
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- Convergence of an interior point algorithm for continuous minimax
- A globally convergent QP-free algorithm for inequality constrained minimax optimization
- Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems
- A spline smoothing Newton method for finite minimax problems
This page was built for publication: Algorithms with adaptive smoothing for finite minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597184)
