A simple computational procedure for optimization problems with functional inequality constraints

In this note, a simple computational procedure is given for solving a class of optimization problems, where an objective function is to be minimized subject to conventional inequality constraints as well as to inequality constraints of the functional type.

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 32; no. 10; pp. 940 - 941
Main Authors Teo, K., Goh, C.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.10.1987
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Computer science; control theory; systems
Constraint optimization
Control theory. Systems
Convergence
Cost function
Differential equations
Exact sciences and technology
Mathematical programming
Optimal control
Quadratic programming
Qualifications
Software packages
System theory
Transforms
Minimization
Systems theory
Algorithm
Optimization
State constraint
Inequality
Online AccessGet full text
ISSN0018-9286
DOI10.1109/TAC.1987.1104471

Cover

More Information
Summary:In this note, a simple computational procedure is given for solving a class of optimization problems, where an objective function is to be minimized subject to conventional inequality constraints as well as to inequality constraints of the functional type.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
DOI:10.1109/TAC.1987.1104471