A computational approach to the maximum principle

DOI10.1016/S0022-0000(71)80032-6zbMath0275.49010MaRDI QIDQ2265658

A. V. Balakrishnan

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

49M15: Newton-type methods

49K15: Optimality conditions for problems involving ordinary differential equations

49K99: Optimality conditions

Related Items

Optimal control problems for evolution equations of parabolic type with nonlinear perturbations, Optimal control problems for semilinear retarded functional differential equations, Penalty approximation of a Sobolev optimal control problem with state constraints, A penalty function proof of a Lagrange multiplier theorem with application to linear delay systems, On the optimal control of strongly nonlinear evolution equations, On equiwellset minimum problems, On the accuracy and existence of solutions to primitive variable models of viscous incompressible fluids, Bounded controlling sequences, lower stability and certain penalty procedures, Metodo epsilon e convergenza di Mosco, State-constrained relaxed problems for semilinear elliptic equations, An integral formulation of the \(\varepsilon\)-problem and a new computational approach to control function optimization

Cites Work

• Multiplier and gradient methods
• A constructive approach to the maximum principle for differential- difference problems using the Balakrishnan's \(\varepsilon\)-technique
• A new computing technique in system identification
• Relaxed Controls and Variational Problems
• On a New Computing Technique in Optimal Control
• Numerical Solution of Dynamical Optimization Problems
• A Generalization of the Method of Balakrishnan: Inequality Constraints and Initial Conditions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item