Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IFAC Proceedings Vol...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IFAC Proceedings Volumes
Article . 1989 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A Generalized Reduced Gradient Algorithm for Solving Large-Scale Discrete-Time Nonlinear Optimal Control Problems

Authors: J.L.D. Facó;

A Generalized Reduced Gradient Algorithm for Solving Large-Scale Discrete-Time Nonlinear Optimal Control Problems

Abstract

Abstract Nonlinear dynamical control systems are considered in a unified approach as discrete-time nonlinear optimal control problems with time delays and inequality constraints on the state and the control variables (usually double bounds). These problems are in general large-scale and efficient numerical solutions can be obtained by constrained Nonlinear Programming methods if reliable techniques able to deal with these numerical difficulties are employed. A generalized reduced gradient algorithm is proposed exploiting the staircase structure of the jacobian matrix of the dynamic equations by using some priority principles on the partition of the variables into basic and independent sets for each time period when a reenversion is needed, and for choosing a substitute basic variable when change-of-basis occur for regularity reasons. Factorized representations of the basic matrix facilitate the resolutions of the linear systems of equations in different parts of the algorithm. Gaussian eliminations (LU decompositions) of the diagonal blocks of the main factor of the representation improve the numerical stability of these processes. In the reduced dimension space of the bounded independent variables we have an unconstrained differentiable nonlinear objective function. The search directions can be computed by adapted unconstrained optimization methods with memory limitation as Conjugate Gradients. If some amount of extra storage is available, limited-storage methods combining properties of the quasi- Newton BFGS and conjugate gradients methods present superior convergence rates. These alternative search directions can improve the convergence of the algorithm. Time delays in the nonlinear dynamic equations can be considered by some specific sparse matrix techniques with no influence on the algorithm main strategy. A computer code has been designed and numerical experiments with different optimization models for applications to electric power generation planning, macroeconomy and fishery management have been solved with encouraging results.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    9
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
9
Top 10%
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!