A smoothing-out technique for min—max optimization
From MaRDI portal
Publication:3922488
DOI10.1007/BF01581628zbMath0468.90064OpenAlexW1995583003MaRDI QIDQ3922488
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581628
unconstrained optimizationnondifferentiable optimizationnon-smooth optimizationcontinuous-discrete min-max optimizationefficient gradient techniquessmoothing-out technique
Related Items
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, A new smoothing approach to exact penalty functions for inequality constrained optimization problems, On the entropic regularization method for solving min-max problems with applications, Algorithms with adaptive smoothing for finite minimax problems, Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, A new global optimization technique by auxiliary function method in a directional search, 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, On the convergence of a smooth penalty algorithm without computing global solutions, A New Smoothing Approach for Piecewise Smooth Functions: Application to Some Fundamental Functions, An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems, The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities, Coupling of finite element and boundary element methods with regularization for a nonlinear interface problem with nonmonotone set-valued transmission conditions, New Smoothing Approximations to Piecewise Smooth Functions and Applications, Uniform approximation of min/max functions by smooth splines, A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities, Flattened aggregate function method for nonlinear programming with many complicated constraints, A smoothing trust-region Newton-CG method for minimax problem, A new objective penalty function approach for solving constrained minimax problems, A box-constrained differentiable penalty method for nonlinear complementarity problems, Unnamed Item, An active-set algorithm and a trust-region approach in constrained minimax problem, Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities, Determination of general equilibrium with incomplete markets and default penalties, A spline smoothing Newton method for finite minimax problems, A smooth method for the finite minimax problem, Nondifferentiable optimization via smooth approximation: General analytical approach, Global convergence and finite termination of a class of smooth penalty function algorithms, Smoothing functions and smoothing Newton method for complementarity and variational inequality problems, On the Regularization Method in Nondifferentiable Optimization Applied to Hemivariational Inequalities, A truncated aggregate smoothing Newton method for minimax problems, Smoothing methods for nonsmooth, nonconvex minimization, Unnamed Item, Smoothing of the lower-order exact penalty function for inequality constrained optimization, From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics, Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power markets, Regularity and Stability of Feedback Relaxed Controls, A class of smoothing functions for nonlinear and mixed complementarity problems, Solving min-max problems and linear semi-infinite programs, On a new smoothing technique for non-smooth, non-convex optimization, An unconstrained differentiable penalty method for implicit complementarity problems, New exact penalty function for solving constrained finite min-max problems, On smoothing exact penalty functions for nonlinear constrained optimization problems, Hyperbolic smoothing function method for minimax problems, An active set smoothing method for solving unconstrained minimax problems, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, An Adaptive Smoothing Method for Continuous Minimax Problems, Error bounds of two smoothing approximations for semi-infinite minimax problems, Smoothing approximations for piecewise smooth functions: a probabilistic approach, A min-max algorithm for non-linear regression models, Solution of minimax problems using equivalent differentiable functions, Continuation method for nonlinear complementarity problems via normal maps, Bayesian analysis of switching regression models
Cites Work
- Unnamed Item
- Unnamed Item
- A New Maximum Likelihood Algorithm for Piecewise Regression
- Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- Objective function approximations in mathematical programming
- Linearly constrained minimax optimization
- A new arc algorithm for unconstrained optimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Non-Linear Programming Via Penalty Functions
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- Constrained Optimization Using a Nondifferentiable Penalty Function