Discrete-time Euler-smoothing methods for time-varying convex constrained optimization

DOI10.1016/j.jfranklin.2024.106898zbMath1541.65041MaRDI QIDQ6559340

Tie Ni, Xuezhi Xie, Wei-Zhe Gu

Publication date: 21 June 2024

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

zbMATH Keywords

Karush-Kuhn-Tucker conditionssmoothing techniqueprediction-correction methodonline optimizationcomplementarity functiontime-varying optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

This page was built for publication: Discrete-time Euler-smoothing methods for time-varying convex constrained optimization