Paperlane

no. 11 · Monday 9 November 2026

Vector Lyapunov functions for nonconvex constrained optimization

Torbjørn Cunis and Ilya Kolmanovsky

math.OC

Abstract

Nonconvex constrained optimization problems are commonly solved by a Newton method for necessary conditions (sequential linear/quadratic programming) or a barrier reformulation (interior-point methods). We present a vector Lyapunov analysis for Newton-type algorithms based on constraint violation and optimality of the primal solutions to a sequence of approximate optimization problems. We thus prove local stability and convergence by constructing a strict Lyapunov function for the primal solution.

comments
Extended version of submission to the 2027 European Control Conference
fields
Optimization and Control
pdf ↗ page arXiv:2611.08729 ↗