Skip to main content
Log in

Feasible direction method for large-scale nonconvex programs: Decomposition approach

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

In this paper, we propose a feasible-direction method for large-scale nonconvex programs, where the gradient projection on a linear subspace defined by the active constraints of the original problem is determined by dual decomposition. Results are extended for dynamical problems which include distributed delays and constraints both in state and control variables. The approach is compared with other feasible-direction approaches, and the method is applied to a power generation problem. Some computational results are included.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Lasdon, L. S.,Optimization Theory for Large Systems, The Macmillan Company, London, England, 1970.

    Google Scholar 

  2. Mesarovic, M. D., Macko, D., andTakahara, K.,Theory of Multilevel Hierarchical Systems, Academic Press, New York, New York, 1970.

    Google Scholar 

  3. Wismer, D. A., Editor,Optimization Methods for Large-Scale Systems, with Applications, McGraw-Hill Book Company, New York, New York, 1971.

    Google Scholar 

  4. Tamura, H.,Decentralized Optimization for Distributed-Lag Models of Discrete Systems, Automatica, Vol. 11, pp. 593–602, 1975.

    Google Scholar 

  5. Arrow, K. J., Hurwick, L., andUzawa, H.,Studies in Linear and Nonlinear Programs, Chapter 10, Stanford University Press, Stanford, California, 1958.

    Google Scholar 

  6. Avriel, M.,Nonlinear Programming, Analysis and Methods, Prentice Hall, London, England, 1976.

    Google Scholar 

  7. Rosen, J. B.,The Gradient Projection Method for Nonlinear Programming, Part 1,Linear Constraints, SIAM Journal on Applied Mathematics, Vol. 8, pp. 181–217, 1960.

    Google Scholar 

  8. Zoutendijk, G.,Methods of Feasible Directions, American Elsevier Publishing Company, New York, New York, 1960.

    Google Scholar 

  9. Luenberger, D.,Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1973.

    Google Scholar 

  10. Fletcher, R., andReeves, C. M.,Function Minimization by Conjugate Gradients, Computer Journal, Vol. 7, pp. 149–154, 1964.

    Google Scholar 

  11. Tamura, H.,Multistage Linear Programming for Discrete Optimal Control with Distributed Lags, Automatica, Vol. 13, pp. 369–376, 1977.

    Google Scholar 

  12. Lyra, C., Soares, S., andTavares, H.,Controle de Sistemas Hidrotermicos de Geraçao, II Congresso Brasileiro de Automatica, Florianopolis, UFSC, Brasil, 1978.

  13. Turgeon, A.,Optimal Operation of a Hydro-Steam Power System, Cornell University, PhD Thesis, 1975.

  14. Abadie, J.,Application of the GRG Algorithm to Optimal Control Problems, Integer and Nonlinear Programming, Edited by J. Abadie, North Holland Publishing Company, Amsterdam, Holland, 1970.

    Google Scholar 

  15. Mehra, R. K., andDavis, R. E.,A Generalized Gradient Method for Optimal Control Problems with Inequality Constraints and Singular Arcs, IEEE Transactions on Automatic Control, Vol. AC-17, pp. 69–79, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. Varaiya

This work was supported by the Conselho Nacional de Desenvolvimento Cientifico e Tecnologico, Brasilia, Brasil, and by the Fundaçao de Amparo a Pesquisa do Estado de Sao Paulo, Sao Paulo, Brazil.

On leave from UNICAMP, Campinas, Brazil.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Geromel, J.C., Baptistella, L.F.B. Feasible direction method for large-scale nonconvex programs: Decomposition approach. J Optim Theory Appl 35, 231–249 (1981). https://doi.org/10.1007/BF00934578

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00934578

Key words

Navigation