Skip to main content
SpringerLink
Log in

A Fast Algorithm for Solving a Simple Search Problem

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

A fast algorithm for solving the Danskin problem is proposed. The dependence of its solution on parameters is analyzed.

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

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.

Similar content being viewed by others

REFERENCES

  1. J. M. Danskin, The Theory of Max-Min and its Application to Weapons Allocation Problems (Springer, Berlin, 1967).

    Book  MATH  Google Scholar 

  2. V. N. Malozemov  and  G. Sh. Tamasyan, “The  Gibbs  lemma  and  its  applications,” Seminar on Constructive Nonsmooth Analysis and Nondifferentiable Optimization (CNSA & NDO), 2017. http:// www.apmath.spbu.ru/cnsa/reps17.shtml#1010. Cited March 1, 2018.

  3. G. Tamasyan and E. Prosolupov, “Orthogonal projection of a point onto the standard simplex: algorithms analysis,” Proc. of the 2015 Int. Conf. on Stability and Control Processes in Memory of V. I. Zubov (SCP), St. Petersburg, Russia, 2015, pp. 353–356. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumbers42137

    Google Scholar 

  4. P. Brucker, “An \(O(n)\) algorithm for quadratic knapsack problems,” Oper. Res. Lett. 3 (3), 163–166 (1984).

    Article  MathSciNet  MATH  Google Scholar 

  5. N. Maculan and G. Galdino de Paula, Jr., “A linear-time median-finding algorithm for projecting a vector on the simplex of \({{\mathbb{R}}^{n}}\),” Oper. Res. Lett. 8 (4), 219–222 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  6. E. Prosolupov and G. Tamasyan, “Estimation of the complexity of an algorithm of finding the zero of a convex piecewise linear function,” Discretn. Anal. Issled. Oper. 25 (2), 82–100 (2018).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University, 199034, St. Petersburg, Russia

    V. N. Malozemov & G. Sh. Tamasyan

Authors
  1. V. N. Malozemov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Sh. Tamasyan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to V. N. Malozemov or G. Sh. Tamasyan.

Additional information

Translated by A. Klimontovich

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Malozemov, V.N., Tamasyan, G.S. A Fast Algorithm for Solving a Simple Search Problem. Comput. Math. and Math. Phys. 59, 851–856 (2019). https://doi.org/10.1134/S0965542519050105

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542519050105

Keywords:

Search

Navigation