Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
From MaRDI portal
Publication:2374365
DOI10.1007/s10589-016-9854-9zbMath1357.90117OpenAlexW2429556411MaRDI QIDQ2374365
Publication date: 15 December 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9854-9
image restorationnonsmooth nonconvex optimizationsmoothing approximationstochastic linear complementarity problem\(\ell_2\)-\(\ell_p\) problemconstrained non-Lipschitz optimizationsmoothing projected Barzilai-Borwein algorithm
Related Items
On the convergence rate of scaled gradient projection method ⋮ An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ A gradient method exploiting the two dimensional quadratic termination property ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ Adaptive step size rules for stochastic optimization in large-scale learning ⋮ Gradient methods exploiting spectral properties ⋮ Stochastic variance reduced gradient methods using a trust-region-like scheme ⋮ On sparse beamformer design with reverberation ⋮ On the asymptotic convergence and acceleration of gradient methods ⋮ Accelerated augmented Lagrangian method for total variation minimization ⋮ A family of spectral gradient methods for optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Gradient methods for minimizing composite functions
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- A Barzilai-Borwein type method for stochastic linear complementarity problems
- A Barzilai-Borwein type method for minimizing composite functions
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems
- A note on the complexity of \(L _{p }\) minimization
- Partial projected Newton method for a class of stochastic linear complementarity problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Robust solution of monotone stochastic linear complementarity problems
- Feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- R-linear convergence of the Barzilai and Borwein gradient method
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained 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
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- On the rate of convergence of projected Barzilai–Borwein methods
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Stochastic $R_0$ Matrix Linear Complementarity Problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Optimization and nonsmooth analysis
- Projected gradient methods for linearly constrained problems
- Two-Point Step Size Gradient Methods
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- Compressed sensing
This page was built for publication: Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
