Skip to content
Log in
Sponsored AI Networking Cookbook: Practical recipes for AI-assisted network automation and development AI Networking Cookbook: Practical recipes for AI-assisted network automation and development

Similar papers

Jul 2026

New Globalized Newton-Type Methods for Nonconvex Optimization Problems

This paper proposes a general line-search Newton framework for unconstrained optimization that avoids repeated Hessian regularization by exploiting the Newton direction only when it is well-defined and suitable and provides the first Newton-type algorithm together with a comprehensive convergence analysis for this impo...

Phat Thanh Vo, Tuyen Tran · 0 citations
Preprint Aug 2026

A Wolfe-Type Spectral Conjugate Gradient Method for Nonsmooth Convex Optimization Problems

The results show that the proposed Wolfe-type spectral conjugate gradient method performs competitively overall, matching or outperforming existing methods on most problems tested, while a few specific limitations of the current implementation are also identified and discussed.

Jauny, G. Kumar · 0 citations
Open access Jul 2026

A Hybrid Conjugate Gradient Method for Unconstrained Optimization with Application in Image Restoration

This paper proposes a hybrid conjugate gradient method for solving unconstrained optimization problems by combining two PRP-type directions via convex combination, which dynamically adjusts to gradient change rates and satisfies the sufficient descent property.

Jia-Yu Zheng, Xiang-Song Zhang · 0 citations
Preprint Jul 2026

Fully Convergent Projection-based Methods with Momentum under Nonconvex Geometric

This work can specifically ensure, without any smoothness assumptions, convergence to Mordukhovich stationarity as long as the base directions asymptotically revert to the negative gradient for small stepsizes.

Matteo Lapucci, Diego Scuppa · 0 citations
Preprint Aug 2026

A proximal gradient method with adaptive backtracking for weakly smooth multiobjective optimization

The proposed proximal gradient method with adaptive linesearch for multiobjective optimization problems whose objective functions are weakly smooth, i.e., they have Holder continuous gradients and the algorithm accepts coercer stationarity measure compared to existing methods is established.

Yuki Miyazaki, Masaru Ito, Shotaro Yagishita · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.