Skip to main content
SpringerLink
Log in

A Sequential Generalized Quadratic Programming Algorithm Using Exact L1 Penalty Functions

  • Conference paper
Operations Research ’93

Abstract

We consider a nonlinear programming problem having equality and inequality constraints:

f,gi:Rn being smooth functions and E1, I1, E2 and I2 being finite sets with cardinals ne, ni, me and mi respectively.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Casas E. and Pola C. (1993)] A sequential generalized quadratic programming algorithm using exact !1 penalty functions. Núm 6/1993, Depto. de Matemâticas, Estadistica y Computación, Univ. de Cantabria (Spain).

    Google Scholar 

  2. Fletcher R. (1982)] Penalty functions. In A. Bachem, M. Grötschel, and B. Korte, editors, Math. Programming. The State of The Art, pages 87–114, Bonn. Springer-Verlag.

    Google Scholar 

  3. Fletcher R. (1981)] Second order corrections for non-differentiable optimization. In G.A. Watson, editor,Lecture Notes in Mathematics 912, pages 16–31, Berlin, 1982. Numerical Analysis Dundee 1! :1, Springer-Verlag.

    Google Scholar 

  4. Fletcher R. (1987)] Practical Methods of Optimization. John Wiley & Sons, Chichester and New York, second edition.

    Google Scholar 

  5. Maratos N. (1978)] Exact Function Penalty Algorithms for Finite Dimensional and Control Optimization Problems. PhD thesis, Imperial College, University of London.

    Google Scholar 

  6. A superlinearly convergent algorithm for constrained optimization problems. Math. Programming Stud., 16: 45–61.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Matemática Aplicada y Ciencias de la Computación, Universidad de Cantabria, E.T.S.I. de Caminos, Cecilia Pola, Spain

    Eduardo Casas

  2. Depto. de Matemáticas, Estadística y Computación Facultad de Ciencias, Universidad de Cantabria, 39071, Santander, Spain

    Cecilia Pola

Authors
  1. Eduardo Casas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cecilia Pola
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematisches Institut, Universität zu Köln, Weyertal 80, D-50931, Köln, Germany

    Achim Bachem

  2. Lehrstuhl für Wirtschaftsinformatik, Universität zu Köln, Pohligstraße 1, D-50969, Köln, Germany

    Ulrich Derigs

  3. Institut für Informatik, Universität zu Köln, Pohligstraße 1, D-50969, Köln, Germany

    Michael Jünger  & Rainer Schrader  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Physica-Verlag Heidelberg

About this paper

Cite this paper

Casas, E., Pola, C. (1994). A Sequential Generalized Quadratic Programming Algorithm Using Exact L1 Penalty Functions . In: Bachem, A., Derigs, U., Jünger, M., Schrader, R. (eds) Operations Research ’93. Physica, Heidelberg. https://doi.org/10.1007/978-3-642-46955-8_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46955-8_23

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-0794-3

  • Online ISBN: 978-3-642-46955-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation