Smoothing methods for nonsmooth, nonconvex minimization
From MaRDI portal
Publication:715249
DOI10.1007/S10107-012-0569-0zbMATH Open1266.90145OpenAlexW2098000549MaRDI QIDQ715249FDOQ715249
Authors: Michael Martin Xiaojun Chen 
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
Recommendations
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Nondifferentiable optimization via smooth approximation: General analytical approach
- Epi-convergent smoothing with applications to convex composite functions
- Smooth minimization of non-smooth functions
- Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems
nonconvex minimizationsmoothing methodsnonsmooth minimizationstochastic variational inequality problems
Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Nearly unbiased variable selection under minimax concave penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Smooth minimization of non-smooth functions
- Asymptotics for Lasso-type estimators.
- A group bridge approach for variable selection
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- Methods of descent for nondifferentiable optimization
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- Robust optimization
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- A smoothing method for mathematical programs with equilibrium constraints
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Sample average approximation methods for a class of stochastic variational inequality problems
- Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
- A note on the complexity of \(L _{p }\) minimization
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Smoothing functions for second-order-cone complementarity problems
- Introduction to Derivative-Free Optimization
- A special newton-type optimization method
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A superlinearly convergent method for a class of complementarity problems with non-Lipschitzian functions
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Stochastic variational inequalities: residual minimization smoothing sample average approximations
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Stochastic equilibrium problems and stochastic mathematical programs with equilibrium constraints: a survey
- Sample-path solution of stochastic variational inequalities
- Optimality conditions via exact penalty functions
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization
- Stochastic $R_0$ Matrix Linear Complementarity Problems
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Title not available (Why is that?)
- Descent methods for composite nondifferentiable optimization problems
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
- Smoothing technique and its applications in semidefinite optimization
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
- Robust solution of monotone stochastic linear complementarity problems
- Title not available (Why is that?)
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A smoothing-out technique for min—max optimization
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- A regularized projection method for complementarity problems with non-Lipschitzian functions
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Title not available (Why is that?)
- Stabilization via Nonsmooth, Nonconvex Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smoothing methods for convex inequalities and linear complementarity problems
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- Identifying structure of nonsmooth convex functions by the bundle technique
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Title not available (Why is that?)
- How to deal with the unbounded in optimization: Theory and algorithms
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- Minimizing the Condition Number of a Gram Matrix
- Optimizing condition numbers
- Pricing American options with uncertain volatility through stochastic linear complementarity models
- A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
- Smoothing Newton and quasi-Newton methods for mixed complementarity problems
- A property of piecewise smooth functions
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- Fast Algorithms for Nonsmooth Compact Fixed-Point Problems
- A trust region method for minimization of nonsmooth functions with linear constraints
- Lipschitz behavior of the robust regularization
- First Order Conditions for Nonsmooth Discretized Constrained Optimal Control Problems
Cited In (only showing first 100 items - show all)
- Learnable descent algorithm for nonsmooth nonconvex image reconstruction
- Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm
- Aggregate subgradient smoothing methods for large scale nonsmooth nonconvex optimisation and applications
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Smoothing techniques and difference of convex functions algorithms for image reconstructions
- Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms
- On a new smoothing technique for non-smooth, non-convex optimization
- A hybrid method for solving systems of nonsmooth equations with box constraints
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
- Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
- Steklov regularization and trajectory methods for univariate global optimization
- Sparse Markowitz portfolio selection by using stochastic linear complementarity approach
- Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- The subdifferential of measurable composite max integrands and smoothing approximation
- A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Non-Lipschitz models for image restoration with impulse noise removal
- Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations
- A first-order smoothing method for minimizing the sum of the \(r\)-largest functions
- Decomposition algorithms for some deterministic and two-stage stochastic single-leader multi-follower games
- The chain rule for VU-decompositions of nonsmooth functions
- Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
- A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
- A smoothing inertial neural network for sparse signal reconstruction with noise measurements via \(L_p-L_1\) minimization
- Smoothing inertial neurodynamic approach for sparse signal reconstruction via \(L_p\)-norm minimization
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Nonsmooth optimization control based on a sandwich model with hysteresis for piezo-positioning systems
- Efficient learning with a family of nonconvex regularizers by redistributing nonconvexity
- Limiting aspects of nonconvex \({TV}^{\phi}\) models
- Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing
- Model building and optimization analysis of MDF continuous hot-pressing process by neural network
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- Generalized Newton method for a kind of complementarity problem
- Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
- An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing
- The proximal methods for solving absolute value equation
- Computation of time optimal control problems governed by linear ordinary differential equations
- A nonconvex truncated regularization and box-constrained model for CT reconstruction
- Fully smoothed \(\ell_1\)-\(TV\) models: bounds for the minimizers and parameter choice
- On the minimization of possibly discontinuous functions by means of pointwise approximations
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Mathematical programming formulations for piecewise polynomial functions
- Consistent approximations in composite optimization
- On sparse beamformer design with reverberation
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing
- A new data-driven robust optimization approach to multi-item newsboy problems
- Non-convex \(\ell_p\) regularization for sparse reconstruction of electrical impedance tomography
- A kind of stochastic eigenvalue complementarity problems
- A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem
- Convergence analyses on sparse feedforward neural networks via group lasso regularization
- On the regularization method in nondifferentiable optimization applied to hemivariational inequalities
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems
- Two-stage stochastic variational inequalities for Cournot-Nash equilibrium with risk-averse players under uncertainty
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- Stochastic Variational Inequality Approaches to the Stochastic Generalized Nash Equilibrium with Shared Constraints
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Variable selection via generalized SELO-penalized linear regression models
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Variable selection via generalized SELO-penalized Cox regression models
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm
- The smoothing gradient method for a kind of special optimization problem
- An efficient non-convex total variation approach for image deblurring and denoising
- An approach to solving convex programs with nonsmooth objectives
- Penalty methods for a class of non-Lipschitz optimization problems
- \(\mathrm S l_1\)QP based algorithm with trust region technique for solving nonlinear second-order cone programming problems
- A smoothing trust region filter algorithm for nonsmooth least squares problems
- Deep relaxation: partial differential equations for optimizing deep neural networks
- Linearly constrained non-Lipschitz optimization for image restoration
- Gradient consistency for integral-convolution smoothing functions
- 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
- Sparse solutions of a class of constrained optimization problems
- Differential variational inequality approach to dynamic games with shared constraints
- A new smoothing approach to exact penalty functions for inequality constrained optimization problems
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- Smoothing neural network for \(L_0\) regularized optimization problem with general convex constraints
- Non-cooperative games with minmax objectives
- Smoothing technique and its applications in semidefinite optimization
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Nondifferentiable optimization by smooth approximations
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- New smoothing approximations to piecewise smooth functions and applications
- A smoothing augmented Lagrangian method for solving simple bilevel programs
- Nondifferentiable optimization via smooth approximation: General analytical approach
- A study of regularization techniques of nondifferentiable optimization in view of application to hemivariational inequalities
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
Uses Software
This page was built for publication: Smoothing methods for nonsmooth, nonconvex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715249)
