Inexact proximal DC Newton-type method for nonconvex composite functions
From MaRDI portal
Publication:6155059
Abstract: We consider a class of difference-of-convex (DC) optimization problems where the objective function is the sum of a smooth function and a possible nonsmooth DC function. The application of proximal DC algorithms to address this problem class is well-known. In this paper, we combine a proximal DC algorithm with an inexact proximal Newton-type method to propose an inexact proximal DC Newton-type method. We demonstrate global convergence properties of the proposed method. In addition, we give a memoryless quasi-Newton matrix for scaled proximal mappings and consider a two-dimensional system of semi-smooth equations that arise in calculating scaled proximal mappings. To efficiently obtain the scaled proximal mappings, we adopt a semi-smooth Newton method to inexactly solve the system. Finally, we present some numerical experiments to investigate the efficiency of the proposed method, showing that the proposed method outperforms existing methods.
Recommendations
- An inexact regularized proximal Newton-type method for nonconvex composite optimization problems
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- New Bregman proximal type algoritms for solving DC optimization problems
Cites work
- scientific article; zbMATH DE number 1421091 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized proximal point algorithm for certain non-convex minimization problems
- A modified BFGS method and its global convergence in nonconvex minimization
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- A proximal difference-of-convex algorithm with extrapolation
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- An inexact successive quadratic approximation method for L-1 regularized optimization
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Analysis of multi-stage convex relaxation for sparse regularization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC formulations and algorithms for sparse optimization problems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Inexact proximal Newton methods for self-concordant functions
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Inexact successive quadratic approximation for regularized optimization
- Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Nearly unbiased variable selection under minimax concave penalty
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
- Optimization theory and methods. Nonlinear programming
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal Newton-type methods for minimizing composite functions
- Proximal splitting methods in signal processing
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Templates for convex cone problems with applications to sparse signal recovery
- Updating Quasi-Newton Matrices with Limited Storage
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(1)
This page was built for publication: Inexact proximal DC Newton-type method for nonconvex composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155059)
