Inexact proximal DC Newton-type method for nonconvex composite functions
From MaRDI portal
Publication:6155059
DOI10.1007/S10589-023-00525-9arXiv2111.07618MaRDI QIDQ6155059FDOQ6155059
Authors: Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe 
Publication date: 16 February 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2111.07618
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
nonsmooth optimizationsemi-smooth Newton methodmemoryless quasi-Newton methodinexact proximal Newton-type methodproximal DC algorithm
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Templates for convex cone problems with applications to sparse signal recovery
- Nearly unbiased variable selection under minimax concave penalty
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Analysis of multi-stage convex relaxation for sparse regularization
- Title not available (Why is that?)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Updating Quasi-Newton Matrices with Limited Storage
- First-order methods in optimization
- Optimization theory and methods. Nonlinear programming
- Proximal splitting methods in signal processing
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A nonsmooth version of Newton's method
- A generalized proximal point algorithm for certain non-convex minimization problems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A modified BFGS method and its global convergence in nonconvex minimization
- An inexact successive quadratic approximation method for L-1 regularized optimization
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Minimization of \(\ell_{1-2}\) for compressed sensing
- Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
- Title not available (Why is that?)
- Inexact proximal Newton methods for self-concordant functions
- Proximal Newton-type methods for minimizing composite functions
- Inexact successive quadratic approximation for regularized optimization
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- DC formulations and algorithms for sparse optimization problems
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A proximal difference-of-convex algorithm with extrapolation
- Memoryless quasi-Newton methods based on spectral-scaling Broyden family for unconstrained optimization
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- On the superiority of PGMs to PDCAs in nonsmooth nonconvex sparse regression
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)
