Abstract

We extend the S-procedure formulation to the general perturbational duality frame and give necessary and sufficient conditions for its validity, pointing out the hidden part of convexity.

Author information

Contact details are reproduced from the original publication and may be historical.

Keywords

  • S-lemma
  • Farkas type Lemma
  • perturbational duality
  • separation of sets
  • Hahn-Banach Theorem
  • conjugacy

Mathematics Subject Classification

90C30, 90C46

References

  1. R. I. Boţ: Conjugate Duality in Convex Optimization, Springer, Berlin (2010).https://doi.org/10.1007/978-3-642-04900-2Google Scholar
  2. B. D. Craven, J. J. Koliha: Generalizations of Farkas’s theorem, SIAM J. Math. Analysis 8 (1977) 983–997.https://doi.org/10.1137/0508076Google Scholar
  3. M. De Lara, J.-B. Hiriart-Urruty: A fresh geometrical look at the general S-procedure, Optim. Letters 16/4 (2022) 1129–1135.https://doi.org/10.1007/s11590-021-01789-yGoogle Scholar
  4. K. Derinkuyu, M. C. Pinar: On the S-procedure and some variants, Math. Meth. Oper. Res. 641 (2006) 55–77.https://doi.org/10.1007/s00186-006-0070-8Google Scholar
  5. N. Dinh, V. Jeyakumar: Farkas’s lemma : three decades of generalizations for mathematical optimization, TOP 22 (2014) 1–22.https://doi.org/10.1007/s11750-014-0319-yGoogle Scholar
  6. E. Ernst, M. Volle: Zero duality gap and attainment with possibly nonconvex data, J. Convex Analysis 23/2 (2016) 615–629.https://doi.org/10.68381/jca23023Google Scholar
  7. F. Flores-Bazan, F. Opazo: Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality, Minimax Theory Appl. 1/2 (2016) 257–290Google Scholar
  8. A. L. Fradkov: Duality theorems for certain nonconvex extremal problems, Sib. Math. J. 14 (1973) 247–264.https://doi.org/10.1007/BF00967951Google Scholar
  9. M. A. Goberna, M. A. Lòpez: Linear Semi-Infinite Optimization, Wiley, Chichester (1998).Google Scholar
  10. V. Jeyakumar: Farkas lemma: generalizations, in: Encyclopedia of Optimization, C. Floudas et al. (eds.), Springer, Boston (2009) 998–1001.https://doi.org/10.1007/978-0-387-74759-0_176Google Scholar
  11. D. T. Luc, M. Volle: On epsilon-stability in optimization, Vietnam J. Math. 46/1 (2018) 149–167.https://doi.org/10.1007/s10013-017-0265-8Google Scholar
  12. J. J. Moreau: Fonctionnelles Convexes, Lecture Notes, Collège de France (1966-1967), second ed. by Fac. di Engegneria, Univ. di Roma Tor Vergata (2003).Google Scholar
  13. M. Moussaoui, M. Volle: Quasicontinuity and united functions in convex duality theory, Comm. Appl. Nonlinear Analysis 4/4 (1997) 73–89.Google Scholar
  14. J.-P. Penot: Unilateral analysis and duality, in: Essays and Surveys in Global Optimization, Ch. Audet et al. (eds.), Springer, New York (2005) 1–37.https://doi.org/10.1007/0-387-25570-2_1Google Scholar
  15. I. Polik, T. Terlaky: A survey of the S-lemma, SIAM Review 49/3 (2007) 371–418.https://doi.org/10.1137/S003614450444614XGoogle Scholar
  16. R. T. Rockafellar: Conjugate Duality and Optimization, CBMS-NSF Regional Conference Series in Applied Mathematics Vol. 16, Society for Industrial and Applied Mathematics, Philadelphia (1974).Google Scholar
  17. M. Teboule: Nonconvex quadratic optimization: a guided tour, talk given at Montpellier (2009); Hidden convexity in nonconvex quadratic optimization, talk given at the One World Optimization Seminar (2020).Google Scholar
  18. V. A. Yakubovich: The S-procedure in nonlinear control theory (in Russian), Vestnik Leningrad Univ. 1 (1971), Mat. Mekh. Astron. 1 (1971) 62–77.Google Scholar

Suggested citation

M. Volle, M. Barro. “General Formulation of the S-Procedure.” Journal of Convex Analysis 31 (2024), No. 4, 1289–1304. https://doi.org/10.68381/jca31064

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2024. Rights now held by Banach Press.