Skip to main content
SpringerLink
Log in

On the S-procedure and Some Variants

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We give a concise review and extension of S-procedure that is an instrumental tool in control theory and robust optimization analysis. We also discuss the approximate S-Lemma as well as its applications in robust optimization.

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

  • Au-Yeung YH (1969) A theorem on a mapping from a sphere to the circle and the simultaneous diagonalisation of two hermitian matrices. Proc Am Math Soc 20:545–548

    Article  MathSciNet  MATH  Google Scholar 

  • Au-Yeung YH, Poon YT (1979) A remark on the convexity and positive definiteness concerning hermitian matrices. Southeast Asian Bull Math 3:85–92

    MathSciNet  MATH  Google Scholar 

  • Barvinok AI (1995) Problems of distance geometry and convex properties of quadratic maps. Discrete Comput Geom 13:189–202

    Article  MathSciNet  MATH  Google Scholar 

  • Ben-Tal A (2002) Conic and robust optimization. Technical report, Israel Institute of Technology, Technion

    Google Scholar 

  • Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions to uncertain linear programs. Math Prog 99:351–376

    Article  MathSciNet  MATH  Google Scholar 

  • Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23:769–805

    Article  MathSciNet  MATH  Google Scholar 

  • Ben-Tal A, Nemirovski A (2000) Lectures on modern convex optimization: analysis, algorithms and engineering applications. SIAM-MPS, Philadelphia

    Google Scholar 

  • Ben-Tal A, Nemirovski A, Roos C (2002) Robust solutions of uncertain quadratic and conic-quadratic problems. SIAM J Optim 13:535–560

    Article  MathSciNet  MATH  Google Scholar 

  • Boyd S, El-Ghaoui L, Feron E, Balakhrishnan V (1994) Linear matrix inequalities in systems and control theory. SIAM, Philadelphia

    Google Scholar 

  • Brickman L (1961) On the fields of values of a matrix. Proc Am Math Soc 12:61–66

    Article  MathSciNet  MATH  Google Scholar 

  • Calabi E (1964) Linear systems of real quadratic forms. Proc Am Math 15:844–846

    Article  MathSciNet  MATH  Google Scholar 

  • Derinkuyu K (2004) On the s-procedure and some variants. Unpublished M.Sc. Thesis, Bilkent University

  • Dines LL (1941) On the mapping of quadratic forms. Bull Am Math Soc 47:494–498

    Article  MathSciNet  MATH  Google Scholar 

  • Dines LL (1942) On the mapping of n quadratic forms. Bull Am Math Soc 48:467–471

    Article  MathSciNet  MATH  Google Scholar 

  • Dines LL (1943) On linear combinations of quadratic forms. Bull Am Math Soc 49:388–393

    Article  MathSciNet  MATH  Google Scholar 

  • El-Ghaoui L, Lebret H (1997) Robust solutions to least-squares problems with uncertain data. SIAM J Matrix Anal Appl 18(4):1035–1064

    Article  MathSciNet  MATH  Google Scholar 

  • El-Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9:33–52

    Article  MathSciNet  MATH  Google Scholar 

  • Finsler P (1936/37) Über das vorkommen definiter und semidefiniter formen in scharen quadratischer formen. Comment Math Helv 9:188–192

    Article  MathSciNet  Google Scholar 

  • Fradkov AL (1973) Duality theorems for certain nonconvex extremum problems. Siberian Math J 14:247–264

    Article  MathSciNet  MATH  Google Scholar 

  • Hausdorff F (1919) Der wertvorrat einer bilinearform. Math Z 3:314–316

    Article  MathSciNet  Google Scholar 

  • Hestenes MR, McShane EJ (1940) A theorem on quadratic forms and its application in the calculus of variations. Trans Am Math Soc 40:501–512

    Article  MathSciNet  Google Scholar 

  • Hiriart-Urruty JB, Torki M (2002) Permanently going back and forth between the quadratic world and the convexity world in optimization. Appl Math Optim 45:169–184

    Article  MathSciNet  MATH  Google Scholar 

  • Horn RA, Johnson CR (1990) Matrix analysis. Cambridge University Press, New York

    MATH  Google Scholar 

  • John F (1938) A note on the maximum principle for elliptic differential equations. Bull Am Math Soc 44:268–271

    Article  MATH  Google Scholar 

  • Kühne R (1964) Über eine klasse j-selbstadjungierter operatoren. Math Ann 154:56–69

    Article  MathSciNet  Google Scholar 

  • Luo Z-Q, Sturm J, Zhang S-Z (2003) Multivariate nonnegative quadratic mappings. Technical report, Chinese University of Hong-Kong

  • Lur’e AI, Postnikov VN (1944) On the theory of stability of control systems (in Russian). Appl Math Mech 8(3)

  • Megretsky A, Treil S (1993) Power distribution inequalities in optimization and robustness of uncertain systems. Math Syst Estimation Control 3:301–319

    MathSciNet  MATH  Google Scholar 

  • Nemirovski A (2002) Five lectures on modern convex optimization. Technical report, Israel Institute of Technology, Technion

    Google Scholar 

  • Peng JM, Yuan Y-X (1997) Optimality conditions for the minimization of a quadratic with two quadratic constraints. SIAM J Optim 7:579–594

    Article  MathSciNet  MATH  Google Scholar 

  • Polyak BT (1998) Convexity of quadratic transformations and its use in control and optimization. J Optim Theory Appl 99:553–583

    Article  MathSciNet  MATH  Google Scholar 

  • Poon YT (1997) Generalized numerical ranges, joint positive definiteness and multiple eigenvalues. Proc Am Math Soc 125:1625–1634

    Article  MathSciNet  MATH  Google Scholar 

  • Taussky O (1967) Positive-definite matrices. In: Shisha O (ed) Inequalities. Academic, New York, pp 309–319

    Google Scholar 

  • Toeplitz O (1918) Das algebraische analogen zu einem satze von fejér. Math Z 2:187–197

    Article  MathSciNet  Google Scholar 

  • Uhlig F (1979) A recurring theorem about pairs of quadratic forms and extension: a survey. Linear Algebra Appl 25:219–237

    Article  MathSciNet  MATH  Google Scholar 

  • Yakubovich VA (1971) The s-procedure in nonlinear control theory. Vestnik Leningr Univ 4: 73–93 in Russian, 1971, No.1, 62–77

    Google Scholar 

  • Yuan Y (1990) On a subproblem of trust region algorithms for constrained optimization. Math Program 47:53–63

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehigh University, Bethlehem, USA

    Kürşad Derinkuyu

  2. Bilkent University, Ankara, Turkey

    Mustafa Ç. Pınar

Authors
  1. Kürşad Derinkuyu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mustafa Ç. Pınar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mustafa Ç. Pınar.

Additional information

The many suggestions and detailed corrections of an anonymous referee are gratefully acknowledged.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Derinkuyu, K., Pınar, M.Ç. On the S-procedure and Some Variants. Math Meth Oper Res 64, 55–77 (2006). https://doi.org/10.1007/s00186-006-0070-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-006-0070-8

Keywords

Search

Navigation