Smoothing methods for nonsmooth, nonconvex minimization

DOI10.1007/s10107-012-0569-0zbMath1266.90145MaRDI QIDQ715249

Publication date: 2 November 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-012-0569-0

zbMATH Keywords

nonconvex minimization; smoothing methods; nonsmooth minimization; stochastic variational inequality problems

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

49M37: Numerical methods based on nonlinear programming

Related Items

Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity, Unnamed Item, Unnamed Item, Bilevel Optimization of Regularization Hyperparameters in Machine Learning, Anderson Acceleration for Nonsmooth Fixed Point Problems, Linearly Constrained Nonsmooth Optimization for Training Autoencoders, Solving Nonsmooth Bi-Objective Environmental andEconomic Dispatch Problem using Smoothing Techniques, An Approximation Scheme for Distributionally Robust Nonlinear Optimization, S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems, The chain rule for VU-decompositions of nonsmooth functions, A smoothing trust region filter algorithm for nonsmooth least squares problems, An approximation scheme for a class of risk-averse stochastic equilibrium problems, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, A new smoothing approach to exact penalty functions for inequality constrained optimization problems, A novel approach for solving nonsmooth optimization problems with application to nonsmooth equations, Computing equilibria in economies with incomplete markets, collateral and default penalties, A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions, Differential variational inequality approach to dynamic games with shared constraints, A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities, Global solutions of non-Lipschitz $S_{2}$-$S_{p}$ minimization over the positive semidefinite cone, Gradient consistency for integral-convolution smoothing functions, A note on the smoothing quadratic regularization method for non-Lipschitz optimization, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, An approximation scheme for stochastic programs with second order dominance constraints, GAITA: a Gauss-Seidel iterative thresholding algorithm for $\ell_q$ regularized least squares regression, Epi-convergence properties of smoothing by infimal convolution, Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems, Convergence of the reweighted $\ell_1$ minimization algorithm for $\ell_2-\ell_p$ minimization, Non-cooperative games with minmax objectives, A smoothing augmented Lagrangian method for solving simple bilevel programs, A new smoothing modified three-term conjugate gradient method for $l_1$-norm minimization problem, Two-stage stochastic variational inequalities for Cournot-Nash equilibrium with risk-averse players under uncertainty, An interior-point $\ell_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization, A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees, Descent gradient methods for nonsmooth minimization problems in ill-posed problems, Variable selection via generalized SELO-penalized linear regression models, A globally convergent algorithm for nonconvex optimization based on block coordinate update, Computation of time optimal control problems governed by linear ordinary differential equations, On the minimization of possibly discontinuous functions by means of pointwise approximations, An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration, Sparse Markowitz portfolio selection by using stochastic linear complementarity approach, The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with $l_1$-norm, A kind of stochastic eigenvalue complementarity problems, Generalized Newton method for a kind of complementarity problem, A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems, Variable selection via generalized SELO-penalized Cox regression models, Iterative reweighted methods for $\ell _1-\ell _p$ minimization, Model building and optimization analysis of MDF continuous hot-pressing process by neural network, A new globally convergent algorithm for non-Lipschitz $\ell_{p}-\ell_q$ minimization, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization, Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games, A unified primal dual active set algorithm for nonconvex sparse recovery, An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing, On a new smoothing technique for non-smooth, non-convex optimization, The proximal methods for solving absolute value equation, Smoothing Newton method for $\ell^0$-$\ell^2$ regularized linear inverse problem, A new data-driven robust optimization approach to multi-item newsboy problems, Real-time pricing method for smart grid based on social welfare maximization model, A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization, Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems, Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization, Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization, Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations, Neural network for nonsmooth pseudoconvex optimization with general convex constraints, Mathematical programming formulations for piecewise polynomial functions, The subdifferential of measurable composite max integrands and smoothing approximation, A nonconvex truncated regularization and box-constrained model for CT reconstruction, A hybrid method for solving systems of nonsmooth equations with box constraints, A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming, Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials, An efficient non-convex total variation approach for image deblurring and denoising, Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints, Signal reconstruction by conjugate gradient algorithm based on smoothing $l_1$-norm, Convergence analyses on sparse feedforward neural networks via group lasso regularization, On sparse beamformer design with reverberation, Steklov regularization and trajectory methods for univariate global optimization, A smoothing iterative method for the finite minimax problem, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, Deep relaxation: partial differential equations for optimizing deep neural networks, Smoothing and regularization strategies for optimization of hybrid dynamic systems, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing, A new global optimization technique by auxiliary function method in a directional search, $l_{p}$-norm regularization method ($ 0<p<1 $) and DC programming for correction system of inconsistency linear inequalities, A novel modeling and smoothing technique in global optimization, A superlinearly convergent $R$-regularized Newton scheme for variational models with concave sparsity-promoting priors, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions, A new hybrid $l_p$-$l_2$ model for sparse solutions with applications to image processing, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, A smoothing proximal gradient algorithm with extrapolation for the relaxation of ${\ell_0}$ regularization problem, Stochastic absolute value equations, Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case, A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization, Linearly Constrained Non-Lipschitz Optimization for Image Restoration, Limiting Aspects of Nonconvex ${TV}^{\phi}$ Models, A smoothing majorization method for matrix minimization, Smoothing quadratic regularization method for hemivariational inequalities, A new approach for solving mixed integer DC programs using a continuous relaxation with no integrality gap and smoothing techniques, Non-convex ℓ_p regularization for sparse reconstruction of electrical impedance tomography, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, Computation of second-order directional stationary points for group sparse optimization, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, Non-Lipschitz Models for Image Restoration with Impulse Noise Removal, New Smoothing Approximations to Piecewise Smooth Functions and Applications, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems, Penalty Methods for a Class of Non-Lipschitz Optimization Problems, On the Regularization Method in Nondifferentiable Optimization Applied to Hemivariational Inequalities, A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction, Sparse Solutions of a Class of Constrained Optimization Problems, Stochastic Variational Inequality Approaches to the Stochastic Generalized Nash Equilibrium with Shared Constraints, Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms, Completely positive factorization by a Riemannian smoothing method, A smoothing inertial neural network for sparse signal reconstruction with noise measurements via $L_p-L_1$ minimization, Stochastic approximation with discontinuous dynamics, differential inclusions, and applications, Smoothing techniques in solving non-Lipschitz absolute value equations, Accelerated smoothing hard thresholding algorithms for $\ell_0$ regularized nonsmooth convex regression problem, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, Consistent approximations in composite optimization, Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem

Uses Software

Cites Work