Relax-and-split method for nonconvex inverse problems
From MaRDI portal
Publication:5123708
DOI10.1088/1361-6420/aba417zbMath1451.90135OpenAlexW3041922139MaRDI QIDQ5123708
Peng Zheng, Aleksandr Y. Aravkin
Publication date: 29 September 2020
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/aba417
Related Items (2)
A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization ⋮ A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Algorithm AS 136: A K-Means Clustering Algorithm
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A proximal method for composite minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- Ordered minimization of total risk in a pattern-recognition problem
- Finite convergence of algorithms for nonlinear programs and variational inequalities
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Support-vector networks
- A Gauss-Newton method for convex composite optimization
- On the history of the shortest path problem
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets
- Efficiency of minimizing compositions of convex functions and smooth maps
- Phase retrieval: stability and recovery guarantees
- Proximal Splitting Methods in Signal Processing
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Weak Sharp Minima in Mathematical Programming
- The Split Bregman Method for L1-Regularized Problems
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- On a routing problem
- Convergence of an Inexact Algorithm for Composite Nonsmooth Optimization
- Introduction to Derivative-Free Optimization
- On the superlinear convergence of a trust region algorithm for nonsmooth optimization
- Descent methods for composite nondifferentiable optimization problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A model algorithm for composite nondifferentiable optimization problems
- An Analysis of Stochastic Shortest Path Problems
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Optical Wavefront Reconstruction: Theory and Numerical Methods
- Solving phase retrieval via graph projection splitting
- Trimmed Statistical Estimation via Variance Reduction
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Methods of conjugate gradients for solving linear systems
- Phase Retrieval via Matrix Completion
This page was built for publication: Relax-and-split method for nonconvex inverse problems
