Smoothing approximations to nonsmooth optimization problems
From MaRDI portal
Recommendations
Cited in
(23)- Nonlinear coordinate representations of smooth optimization problems
- Smooth nonlinear optimization of \(\mathbb R^n\)
- scientific article; zbMATH DE number 1421256 (Why is no real title available?)
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Smooth Approximation of the Quantile Function Derivatives
- Smoothing approximations for some piecewise smooth functions
- scientific article; zbMATH DE number 4119957 (Why is no real title available?)
- Smoothing technique and its applications in semidefinite optimization
- Composite nonsmooth optimization using approximate generalized gradient vectors
- Nondifferentiable optimization by smooth approximations
- Smoothing functions for sparse optimization: a unified framework
- A second-order smooth penalty function algorithm for constrained optimization problems
- Smooth minimization of non-smooth functions
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Consistent approximations in composite optimization
- Smoothing by mollifiers. II: Nonlinear optimization
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- scientific article; zbMATH DE number 6692416 (Why is no real title available?)
- A variable smoothing algorithm for solving convex optimization problems
This page was built for publication: Smoothing approximations to nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4844542)
