A numerical method of solving convex problems of optimal control for distributed systems
type: Item
instance of: scholarly article
title: A numerical method of solving convex problems of optimal control for distributed systems
zbMATH Open document ID: 0714.49031
author: S. V. Solodova
author: N. M. Novikova
published in: Moscow University Computational Mathematics and Cybernetics
publication date: 1990-01-01T00:00:00Z
review text: The authors give a numerical algorithm for the solution of convex optimal control problems for systems governed by linear partial differential equations. The algorithm is based on the method of reduced gradients combined with stochastic generalized gradients. For the inequality constraints an integral penalty function is proposed. A convergence theorem is given.
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 49K20
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 93C20
Mathematics Subject Classification ID: 93B40
zbMATH DE Number: 4175847
zbMATH Keywords: methods of moments
zbMATH Keywords: reduced gradients
zbMATH Keywords: stochastic generalized gradients
zbMATH Keywords: integral penalty function
MaRDI profile type: Publication
Recommended article: Q5169089
Recommended article: Q3734991
Recommended article: Convex Relaxation for Optimal Distributed Control Problems
Recommended article: Numerical analysis of a distributed optimal control problem governed by an elliptic variational inequality
Recommended article: Solvability of mixed-type optimal control problems for distributed systems
Recommended article: Q4235145
Recommended article: Distributed Solution of Optimal Control Problems Governed by Parabolic Equations
Recommended article: Q3681457
Recommended article: Q3764784
Recommended article: Some approximate methods for solving problems of optimal control of distributed parameter systems
description: scientific article; zbMATH DE number 4175847