A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
From MaRDI portal
Publication:5210511
DOI10.1137/18M119611XOpenAlexW2996772801WikidataQ126412965 ScholiaQ126412965MaRDI QIDQ5210511
Publication date: 21 January 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m119611x
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)
Related Items (10)
An interior stochastic gradient method for a class of non-Lipschitz optimization problems ⋮ Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising ⋮ A convergent iterative support shrinking algorithm for non-Lipschitz multi-phase image labeling model ⋮ Accelerated smoothing hard thresholding algorithms for \(\ell_0\) regularized nonsmooth convex regression problem ⋮ 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 ⋮ Integrated intelligent computing with neuro-swarming solver for multi-singular fourth-order nonlinear Emden-Fowler equation ⋮ A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Gradient consistency for integral-convolution smoothing functions
- A first-order interior-point method for linearly constrained smooth optimization
- An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
- Smoothing methods for nonsmooth, nonconvex minimization
- An affine scaling method for optimization problems with polyhedral constraints
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- On the convergence of an active-set method for ℓ1minimization
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
- A First-Order Smoothed Penalty Method for Compressed Sensing
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
- A New Active Set Algorithm for Box Constrained Optimization
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- Clarke Subgradients of Stratifiable Functions
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- Lectures on Stochastic Programming
- Projected gradient methods for linearly constrained problems
- An active set method for solving linearly constrained nonsmooth optimization problems
- On the Accurate Identification of Active Constraints
- Variational Analysis
- Spectral Unmixing via Data-Guided Sparsity
- Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Newton's Method for Large Bound-Constrained Optimization Problems
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- A New Active Set Method For Nonnegative Matrix Factorization
- Cardinality versusq-norm constraints for index tracking
- Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
This page was built for publication: A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
