Skip to main content
SpringerLink
Log in

Convex programming algorithms using smoothing of exact penalty functions

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. I. I. Eremin, “The penalty method in convex programming,” Dokl. Akad. Nauk SSSR,173, No. 4, 748–751 (1967).

    Google Scholar 

  2. R. Rockafellar, Convex Analysis. Princeton Univ. Press.

  3. C. Grossmann and A. A. Kaplan, Strafmethoden und modifizierte Lagrangefunktionen in der nichtlenearen Optimierung, Teubner, Leipzig (1979).

    Google Scholar 

  4. A. V. Fiacco and G. P. McCormick, Nonlinear Programming, Wiley (1968).

  5. B. Martinet, “Détermination approchée d'un point fixe d'une application pseudocontractante,” C. R. Acad. Sci., Paris,274, 163–165 (1972).

    Google Scholar 

  6. R. T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM J. Control.,14, No. 5, 877–898 (1976).

    Google Scholar 

  7. A. S. Antinin, “On a method of convex programming using a symmetric modification of the Lagrange function,” Ekonom. Mat. Metody,11, No. 6, 1164–1173 (1976).

    Google Scholar 

  8. A. S. Antinin, “Nonlinear programming methods based on direct and dual modification of the Lagrange function,” VNII Sistemmykh Issled. Preprint, Moscow (1979).

  9. A. A. Kaplan, “On a method of convex programming using interior regularization,” Dokl. Akad. Nauk SSSR,241, No. 1, 22–25 (1978).

    Google Scholar 

  10. A. B. Bakushinskii, “Methods for solving monotone variational inequalities based on an iterative regularization principle,” Zh. Vychisl. Mat. Mat. Fiz.,17, No. 6, 1350–1362 (1977).

    Google Scholar 

  11. A. N. Tikhonov et al., “Regularization of minimization problems on approximately defined sets,” Vestn. Mosk. gos. Univ., Ser. Vychisl. Mat. Kibern., No. 1, 4–19 (1977).

    Google Scholar 

  12. F. P. Vasil'ev, “Regularization of ill-posed problems on approximately defined sets,” Zh. Vychisl. Mat. Mat. Fiz.,20, No. 1, 38–50 (1980).

    Google Scholar 

Download references

Authors
  1. A. A. Kaplan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Mathematics Institute, Academy of Sciences of the USSR, Siberian Branch, Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 23, No. 4, pp. 53–64, July–August, 1982.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kaplan, A.A. Convex programming algorithms using smoothing of exact penalty functions. Sib Math J 23, 491–500 (1982). https://doi.org/10.1007/BF00968654

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation