A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
From MaRDI portal
Publication:6175368
DOI10.3934/JIMO.2023016zbMath1524.65228arXiv2205.02667OpenAlexW4321380179MaRDI QIDQ6175368
Publication date: 21 July 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.02667
variable metricbacktracking line searchdifference-of-convex programmingcompressed sensing with Poisson noiseNesterov's extrapolationsparse binary logistic regression
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- DC approximation approaches for sparse optimization
- Gradient methods for minimizing composite functions
- Fast first-order methods for composite convex optimization with backtracking
- An efficient DC programming approach for portfolio decision with higher moments
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- The ABC of DC programming
- On the surfaces representable as difference of convex functions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- A proximal difference-of-convex algorithm with extrapolation
- DC programming and DCA: thirty years of developments
- DC formulations and algorithms for sparse optimization problems
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming: overview.
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- Discrete dynamical system approaches for Boolean polynomial optimization
- Variable metric techniques for forward-backward methods in imaging
- A difference-of-convex programming approach with parallel branch-and-bound for sentence compression via a hybrid extractive model
- An inertial algorithm for DC programming
- Adaptive restart for accelerated gradient schemes
- A new efficient algorithm based on DC programming and DCA for clustering
- A Variable Metric Forward-Backward Method with Extrapolation
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- DC Programming Approaches for BMI and QMI Feasibility Problems
- A DC Programming Approach for Mixed-Integer Linear Programs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Compressed Sensing Performance Bounds Under Poisson Noise
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
- First-Order Methods in Optimization
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Minimization of $\ell_{1-2}$ for Compressed Sensing
- Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex Analysis
- A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- A refined inertial DC algorithm for DC programming
This page was built for publication: A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
