A smoothing-out technique for min-max optimization
From MaRDI portal
Cites work
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- A new arc algorithm for unconstrained optimization
- A New Maximum Likelihood Algorithm for Piecewise Regression
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Constrained Optimization Using a Nondifferentiable Penalty Function
- scientific article; zbMATH DE number 3844909 (Why is no real title available?)
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- Linearly constrained minimax optimization
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
- Non-Linear Programming Via Penalty Functions
- Objective function approximations in mathematical programming
Cited in
(69)- On smoothing exact penalty functions for nonlinear constrained optimization problems
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- A min-max algorithm for non-linear regression models
- Solution of minimax problems using equivalent differentiable functions
- Bayesian analysis of switching regression models
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- On the entropic regularization method for solving min-max problems with applications
- Continuation method for nonlinear complementarity problems via normal maps
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Solving min-max problems and linear semi-infinite programs
- An active-set algorithm and a trust-region approach in constrained minimax problem
- Determination of general equilibrium with incomplete markets and default penalties
- Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets
- On a new smoothing technique for non-smooth, non-convex optimization
- Smoothing approximations for piecewise smooth functions: a probabilistic approach
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- A new global optimization technique by auxiliary function method in a directional search
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Coupling of finite element and boundary element methods with regularization for a nonlinear interface problem with nonmonotone set-valued transmission conditions
- From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics
- An unconstrained differentiable penalty method for implicit complementarity problems
- Hyperbolic smoothing function method for minimax problems
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- Regularity and stability of feedback relaxed controls
- The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities
- On the convergence of a smooth penalty algorithm without computing global solutions
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities
- A new objective penalty function approach for solving constrained minimax problems
- Global convergence and finite termination of a class of smooth penalty function algorithms
- A box-constrained differentiable penalty method for nonlinear complementarity problems
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- A Garding inequality based unified approach to various classes of semi-coercive variational inequalities applied to non-monotone contact problems with a nested max-min superpotential
- An adaptive smoothing method for continuous minimax problems
- A spline smoothing Newton method for finite minimax problems
- New smoothing approximations to piecewise smooth functions and applications
- On the regularization method in nondifferentiable optimization applied to hemivariational inequalities
- Algorithms with adaptive smoothing for finite minimax problems
- Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations
- Statistical modeling of changes in relative sea level in Maine during the Holocene Era
- Smoothing techniques in solving non-Lipschitz absolute value equations
- A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions
- Uniform approximation of min/max functions by smooth splines
- A smooth method for the finite minimax problem
- A novel class of exact penalty function approach for optimization problems with inequality constraints
- An application of exponential smoothing technique in image restoration
- A unified approach for smoothing approximations to the exact _1-penalty for inequality-constrained optimization
- A new approach for solving minimax problems using new generation smoothing techniques
- Introducing three new smoothing functions: analysis on smoothing-Newton algorithms
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- A reweighted _1-penalty method for nonlinear complementarity problems
- A new smoothing function technique for solving minimax problems
- A sparse smoothing Newton method for solving discrete optimal transport problems
- Smoothing methods for nonsmooth, nonconvex minimization
- A class of objective filled penalty functions for minimax global optimization problem
- A new smoothing Newton-type two-step algorithm to solve non-Lipschitz absolute value equations of the form \(Ax + B|x|^p = b\)
- Smoothing functions for sparse optimization: a unified framework
- The gradient's limit of a definable family of functions admits a variational stratification
- Mixed finite element methods for elliptic obstacle problems
- Smoothing characterizations of nonsmooth multiobjective optimization problems
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- New exact penalty function for solving constrained finite min-max problems
- An active set smoothing method for solving unconstrained minimax problems
- A smoothing trust-region Newton-CG method for minimax problem
- A truncated aggregate smoothing Newton method for minimax problems
This page was built for publication: A smoothing-out technique for min-max optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922488)