On the iterative regularization of the Lagrange principle in convex optimal control problems for distributed systems of the Volterra type with operator constraints

DOI10.1134/S0012266122060076zbMath1497.49032OpenAlexW4295880292WikidataQ114075311 ScholiaQ114075311MaRDI QIDQ2172448

V. I. Sumin, M. I. Sumin

Publication date: 15 September 2022

Published in: Differential Equations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0012266122060076

zbMATH Keywords

iterative regularizationconvex optimal controliterative dual regularization

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions for problems involving ordinary differential equations (49K15)

Cites Work

• Regularization of the classical optimality conditions in optimal control problems for linear distributed systems of Volterra type
• Regularized parametric Kuhn-Tucker theorem in a Hilbert space
• Lagrange's principle in extremum problems with constraints
• Methods for solving monotonic variational inequalities, based on the principle of iterative regularization
• Nondifferential Kuhn–Tucker theorems in constrained extremum problems via subdifferentials of nonsmooth analysis
• Regularized classical optimality conditions in iterative form for convex optimization problems for distributed Volterra-type systems
• Duality-based regularization in a linear convex mathematical programming problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the iterative regularization of the Lagrange principle in convex optimal control problems for distributed systems of the Volterra type with operator constraints