This paper proposes and develops new Newton-type methods to solve structured nonconvex and nonsmooth optimization problems with justifying their fast local and global convergence by means of advanced tools of variational analysis and generalized differentiation. The objective functions belong to a broad class of prox-regular functions with specification to constrained optimization of nonconvex structured sums. We also develop a novel line search method, which is an extension of the proximal gradient algorithm while allowing us to globalize the proposed coderivative-based Newton methods by incorporating the machinery of forward-backward envelopes. Applications and numerical experiments, which are provided for nonconvex least squares regression models, Student’s t-regression with an $$\ell ^0$$-penalty, and image restoration problems, demonstrate the efficiency of the proposed algorithms.
Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization. // Applied Nanoscience. – 2026. – DOI: 10.1007/s10107-026-02420-7. – URL: https://link.springer.com/article/10.1007/s10107-026-02420-7
(2026). Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization. Applied Nanoscience. https://doi.org/10.1007/s10107-026-02420-7
“Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization.” Applied Nanoscience, 2026. doi:10.1007/s10107-026-02420-7.
@article{article34424,
title = {Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization},
journal = {Applied Nanoscience},
year = {2026},
doi = {10.1007/s10107-026-02420-7},
url = {https://link.springer.com/article/10.1007/s10107-026-02420-7}
}
An algorithm based on the interior-point methodology for solving continuous nonlinearly constrained optimization problems is proposed, analyzed, and tested. The distinguishing feature of the algorithm is that it presumes that only noisy...
Introduced by Beck and Teboulle in [1], FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov’s accelerated gradient method for convex functions [2],...
The progressive decoupling algorithm solves problems of optimization by iteratively suppressing complications coming from linear linkage relations. Here its formulation is significantly extended and a sharper theory of convergence is...
This paper introduces a class of two-stage stochastic minimax problems where the first-stage objective function is nonconvex-concave while the second-stage objective function is strongly convex-concave. We establish properties of the...
Inspired by Von Neumann’s foundational work on expected utility, this paper extends the data-driven expected utility maximization framework under constant absolute risk aversion (CARA) preferences by incorporating nonlinear payoff...