Smoothing methods for nonsmooth, nonconvex minimization
DOI10.1007/s10107-012-0569-0zbMath1266.90145OpenAlexW2098000549MaRDI 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
nonconvex minimizationsmoothing methodsnonsmooth minimizationstochastic variational inequality problems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)
Related Items (only showing first 100 items - show all)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Smooth minimization of non-smooth functions
- Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints
- A note on the complexity of \(L _{p }\) minimization
- Pricing American options with uncertain volatility through stochastic linear complementarity models
- 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
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A smoothing method for mathematical programs with equilibrium constraints
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- A trust region method for minimization of nonsmooth functions with linear constraints
- How to deal with the unbounded in optimization: Theory and algorithms
- A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
- A smoothing method for a mathematical program with P-matrix linear complementarity constraints
- Sample-path solution of stochastic variational inequalities
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- A property of piecewise smooth functions
- Smoothing Newton and quasi-Newton methods for mixed complementarity problems
- Asymptotics for Lasso-type estimators.
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- Smoothing methods for convex inequalities and linear complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- Methods of descent for nondifferentiable optimization
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Stochastic Variational Inequalities: Residual Minimization Smoothing Sample Average Approximations
- Minimizing the Condition Number of a Gram Matrix
- 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
- A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions
- Optimality Conditions via Exact Penalty Functions
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Lipschitz Behavior of the Robust Regularization
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Stochastic $R_0$ Matrix Linear Complementarity Problems
- SAMPLE AVERAGE APPROXIMATION METHODS FOR A CLASS OF STOCHASTIC VARIATIONAL INEQUALITY PROBLEMS
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
- Optimizing Condition Numbers
- Introduction to Derivative-Free Optimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A group bridge approach for variable selection
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Optimization and nonsmooth analysis
- Descent methods for composite nondifferentiable optimization problems
- A smoothing-out technique for min—max optimization
- Fast Algorithms for Nonsmooth Compact Fixed-Point Problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- A special newton-type optimization method
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- First Order Conditions for Nonsmooth Discretized Constrained Optimal Control Problems
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
- Stabilization via Nonsmooth, Nonconvex Optimization
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
- A regularized projection method for complementarity problems with non-Lipschitzian functions
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- Analysis of the Recovery of Edges in Images and Signals by Minimizing Nonconvex Regularized Least-Squares
This page was built for publication: Smoothing methods for nonsmooth, nonconvex minimization