On a new smoothing technique for non-smooth, non-convex optimization
From MaRDI portal
Publication:2061308
DOI10.3934/naco.2020004zbMath1476.90274OpenAlexW3004568796MaRDI QIDQ2061308
Nurullah Yilmaz, Ahmet Sahiner
Publication date: 13 December 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020004
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)
Related Items (3)
Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ Smoothing Levenberg-Marquardt algorithm for solving non-Lipschitz absolute value equations ⋮ Smoothing techniques in solving non-Lipschitz absolute value equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Global descent method for constrained continuous global optimization
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- A new filled function method with two parameters for global optimization
- Global descent methods for unconstrained global optimization
- Smoothing methods for nonsmooth, nonconvex minimization
- A filled function method for global optimization with inequality constraints
- Optimal covering of plane domains by circles via hyperbolic smoothing
- A parameter free filled function for unconstrained global optimization
- A filled function method for finding a global minimizer of a function of several variables
- A filled function method for constrained global optimization
- A cut-peak function method for global optimization
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Virtuous smoothing for global optimization
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
- Globally-biased disimpl algorithm for expensive global optimization
- A modified tunneling function method for non-smooth global optimization and its application in artificial neural network
- RMARS: robustification of multivariate adaptive regression spline under polyhedral uncertainty
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- Stochastic global optimization.
- The hyperbolic smoothing clustering method
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Hyperbolic smoothing function method for minimax problems
- Global Descent Method for Global Optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Optimization and nonsmooth analysis
- The Tunneling Algorithm for the Global Minimization of Functions
- A smoothing-out technique for min—max optimization
- Fuzzy goal programming approach for structural optimization
- Variational Analysis
- More Virtuous Smoothing
- An Adaptive Smoothing Method for Continuous Minimax Problems
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Spline regression models for complex multi-modal regulatory networks
- A new filled function method for global optimization
- A new filled function method for unconstrained global optimization
This page was built for publication: On a new smoothing technique for non-smooth, non-convex optimization
