Skip to main content
SpringerLink
Log in

Monotone Modifications of r-Algorithms and Their Applications

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Monotone modifications of r-algorithms and their applications to solution of various optimization problems (special quadratic, max-cut, minimax) are considered. The computational experimental results are given.

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

Similar content being viewed by others

REFERENCES

  1. B. N. Pshenichnyi, Linearization Methods [in Russian], Nauka, Moscow (1983).

    Google Scholar 

  2. I. I. Eremin, “On the method of “penalties” in convex programming,” Kibernetika, No. 4, 63-67 (1967).

  3. D. Bertsekas, Conditional Optimizations and Methods of Lagrangian Multipliers [in Russian], Radio i Svyaz', Moscow (1987).

    Google Scholar 

  4. N. Z. Shor, Nondifferentiable Optimization and Polynomial Problems, Kluwer Acad. Publ., Boston–Dordrecht–London (1998).

    Google Scholar 

  5. F. Barahona, M. Grotshel, and A. Maxjoub, “Facets of the bipartite subgraph polytope,” Math. Oper. Res., 10, 340-358 (1985).

    Google Scholar 

  6. F. Barahona and A. Maxjoub, “On the cut polytope,” Math. Programming, 36, 157-173 (1986).

    Google Scholar 

  7. M. Grotschel, L. Lovasz, and A. Schrijver, “Geometric algotithms and combinatorial optimization,” in: Combinatorics, Vol. 2, Springer-Verlag, Berlin (1988).

    Google Scholar 

  8. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  9. N. Z. Shor, Methods of Minimization of Nondifferentiable Functions and their Applications [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

  10. V. S. Mikhalevich, V. A. Trubin, and N. Z. Shor, Optimization Problems of Industrial and Transport Scheduling [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  11. L. G. Khachiyan, “Polynomial algorithms in linear programming,” Dokl. AN SSSR, 244, No. 5, 1093-1096 (1979).

    Google Scholar 

  12. N. Z. Shor, “The method of cut-off with space dilatation for solving convex programming problems,” Kibernetika, No. 1, 94-95 (1977).

  13. A. S. Nemirovskii and D. B. Yudin, Information Complexity and Efficient Methods of the Solution of Convex Extremum Problems [in Russian], Nauka, Moscow (1978).

    Google Scholar 

  14. R. J. Vanderbei, “LOQO: An interior point code for quadratic programming,” in: Techn. Rep. SOR-94-15, School of Eng. and Applied Sci., Dep. of Civil Eng. and Oper. Res., Princeton Univ. (1994).

  15. R. Fourer, D. Gay, and B. Kernighan, AMPL: A Modeling Language for Mathematical Programming, Press-Brooks-Cole Publ. Co., Duxbury (1993).

    Google Scholar 

  16. N. Z. Shor and L. P. Shabashova, “Solution of minimax problems using the generalized gradient descent method with space dilatation,” Kibernetika, No. 1, 82-88 (1972).

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kiev, Ukraine

    N. Z. Shor

Authors
  1. N. Z. Shor
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shor, N.Z. Monotone Modifications of r-Algorithms and Their Applications. Cybernetics and Systems Analysis 38, 855–872 (2002). https://doi.org/10.1023/A:1022991904813

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022991904813

Search

Navigation