AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
TL;DR
A minimal-gradient subspace method for unconstrained optimization of SPD quadratics, which attains the highest success count, whereas L-BFGS requires fewer median gradient evaluations and less CPU time.
For solving nonconvex equality-constrained optimization problems, a recent Gradient-Eigenstep Algorithm by Goyens et al.~is an iteration-efficient approach, based on minimizing Fletcher's augmented Lagrangian function, for finding an approximate second-order stationary point from an arbitrary starting point. In this pa...
This work proposes a nonlinear-residual linearized augmented Lagrangian method (NR-LALM) that replaces this subproblem by a regularized Gauss-Newton-type step while retaining the classical multiplier update based on the nonlinear constraint residual.
This article derives a projected gradient flow characterized by tangent and normal cone decompositions, which capture the local geometry of the constraint set and shows that constraint geometry continuously filters gradient directions along the optimization trajectory, leading to a trajectory-dependent implicit regular...
A simple compact-restriction principle for applying conditional gradient steps to unbounded feasible regions and records constructive restrictions based on strong convexity, exact sublevel sets, and epigraph caps.
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...
The results indicate that one-sided H\"older curvature is an effective adaptive step-size signal when full-gradient variation is inflated by directions that do not hinder descent.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.