Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
From MaRDI portal
Publication:3563898
DOI10.1137/070702187zbMath1204.65073OpenAlexW1984395157MaRDI QIDQ3563898
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/6108
numerical experimentsimage restorationstochastic linear complementarity problemnonsmooth nonconvex constrained optimizationsmooth projected gradient method
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (40)
A smoothing Levenberg-Marquardt method for nonlinear complementarity problems ⋮ Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization ⋮ Properties of expected residual minimization model for a class of stochastic complementarity problems ⋮ Convergence results of a matrix splitting algorithm for solving weakly nonlinear complementarity problems ⋮ General fixed-point method for solving the linear complementarity problem ⋮ Bilevel direct search method for leader-follower problems and application in health insurance ⋮ Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems ⋮ Stochastic variational inequalities: single-stage to multistage ⋮ Stochastic \(R_0\) tensors to stochastic tensor complementarity problems ⋮ Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems ⋮ A two-stage stochastic variational inequality model for storage and dynamic distribution of medical supplies in epidemic management ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem ⋮ On set-valued complementarity problems ⋮ A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem ⋮ Stochastic absolute value equations ⋮ A sample average approximation method based on a D-gap function for stochastic variational inequality problems ⋮ Evolution differential inclusion with projection for solving constrained nonsmooth convex optimization in Hilbert space ⋮ On solving simple bilevel programs with a nonconvex lower level program ⋮ Minimal zero norm solutions of linear complementarity problems ⋮ A new approximation of the matrix rank function and its application to matrix rank minimization ⋮ A Barzilai-Borwein type method for stochastic linear complementarity problems ⋮ Smoothing quadratic regularization method for hemivariational inequalities ⋮ Stochastic \(R_0\) matrix linear complementarity problems: the Fischer-Burmeister function-based expected residual minimization ⋮ Minimum mean-squared deviation method for stochastic complementarity problems ⋮ Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems ⋮ Feasible smooth method based on Barzilai-Borwein method for stochastic linear complementarity problem ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems ⋮ Two-stage stochastic variational inequalities: theory, algorithms and applications ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ A smoothing augmented Lagrangian method for solving simple bilevel programs ⋮ Stochastic structured tensors to stochastic complementarity problems ⋮ Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case ⋮ Computation of generalized differentials in nonlinear complementarity problems ⋮ Two-stage stochastic variational inequality arising from stochastic programming ⋮ Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs ⋮ Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction ⋮ A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization ⋮ A smooth penalty-based sample average approximation method for stochastic complementarity problems
This page was built for publication: Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
