Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Regularization of classical optimality conditions in optimization problems of linear distributed Volterra-type systems with pointwise state constraints

View through CrossRef
The regularization of classical optimality conditions (COCs) — the Lagrange principle (LP) and the Pontryagin maximum principle (PMP) — in a convex optimal control problem with a strongly convex objective functional and with pointwise state constraints of the equality and inequality type is considered. The control system is defined by a linear functional-operator equation of the second kind of general form in the space L_2^s, the main operator of the righthand side of the equation is assumed to be quasi-nilpotent. Obtaining regularized COCs is based on the dual regularization method. The main purpose of regularized LP and PMP is stable generation of minimizing approximate solutions (MASs) in the sense of J. Warga. Regularized COCs: 1) are formulated as existence theorems of MASs in the original problem with simultaneous constructive representation of these solutions; 2) are expressed in terms of regular classical Lagrange and Hamilton–Pontryagin functions; 3) “overcome” the ill-posedness properties of the COCs and provide regularizing algorithms for solving optimization problems. The article continues a series of works by the authors on the regularization of the COCs for a number of canonical problems of optimal control of linear distributed systems of the Volterra type. As an application of the “abstract results” obtained in the work, the final part considers the regularization of the COCs in a specific optimization problem with pointwise state constraints of the equality and inequality type for a control system with delay.
Title: Regularization of classical optimality conditions in optimization problems of linear distributed Volterra-type systems with pointwise state constraints
Description:
The regularization of classical optimality conditions (COCs) — the Lagrange principle (LP) and the Pontryagin maximum principle (PMP) — in a convex optimal control problem with a strongly convex objective functional and with pointwise state constraints of the equality and inequality type is considered.
The control system is defined by a linear functional-operator equation of the second kind of general form in the space L_2^s, the main operator of the righthand side of the equation is assumed to be quasi-nilpotent.
Obtaining regularized COCs is based on the dual regularization method.
The main purpose of regularized LP and PMP is stable generation of minimizing approximate solutions (MASs) in the sense of J.
Warga.
Regularized COCs: 1) are formulated as existence theorems of MASs in the original problem with simultaneous constructive representation of these solutions; 2) are expressed in terms of regular classical Lagrange and Hamilton–Pontryagin functions; 3) “overcome” the ill-posedness properties of the COCs and provide regularizing algorithms for solving optimization problems.
The article continues a series of works by the authors on the regularization of the COCs for a number of canonical problems of optimal control of linear distributed systems of the Volterra type.
As an application of the “abstract results” obtained in the work, the final part considers the regularization of the COCs in a specific optimization problem with pointwise state constraints of the equality and inequality type for a control system with delay.

Related Results

Regularization of classical optimality conditions in optimization problems for linear Volterra-type systems with functional constraints
Regularization of classical optimality conditions in optimization problems for linear Volterra-type systems with functional constraints
We consider the regularization of classical optimality conditions (COCs) — the Lagrange principle (LP) and the Pontryagin maximum principle (PMP) — in a convex optimal control prob...
Analytical Solutions to Minimum-Norm Problems
Analytical Solutions to Minimum-Norm Problems
For G∈Rm×n and g∈Rm, the minimization min∥Gψ−g∥2, with ψ∈Rn, is known as the Tykhonov regularization. We transport the Tykhonov regularization to an infinite-dimensional setting, t...
Regularized classical optimality conditions in iterative form for convex optimization problems for distributed Volterra-type systems
Regularized classical optimality conditions in iterative form for convex optimization problems for distributed Volterra-type systems
We consider the regularization of the classical optimality conditions (COCs) — the Lagrange principle and the Pontryagin maximum principle — in a convex optimal control problem wit...
Robust H∞ Feedback Compensator Design for Linear Parabolic DPSs with Pointwise/Piecewise Control and Pointwise/Piecewise Measurement
Robust H∞ Feedback Compensator Design for Linear Parabolic DPSs with Pointwise/Piecewise Control and Pointwise/Piecewise Measurement
In this paper, a robust H∞ control problem of a class of linear parabolic distributed parameter systems (DPSs) with pointwise/piecewise control and pointwise/piecewise measurement ...
Case in Optimality Theory
Case in Optimality Theory
AbstractIn optimality theory, a grammar consists of a set of constraints which are violable and typically conflicting. That these constraints are violable implies that an output of...
Optimizing motor-timing decision via adaptive risk-return control
Optimizing motor-timing decision via adaptive risk-return control
Human’s ability of optimal motor-timing decision remains debated. The optimality seems context-dependent as the sub-optimality was often observed for tasks with different gain/loss...

Back to Top