IOFFE, A. D., LUCCHETTI, R. E. und REVALSKI, J. P., 2004. Almost Every Convex or Quadratic Programming Problem Is Well Posed. Mathematics of Operations Research. 1 Mai 2004. Vol. 29, no. 2, p. 369-382. DOI 10.1287/moor.1030.0080.
Elsevier - Harvard (with titles)Ioffe, A.D., Lucchetti, R.E., Revalski, J.P., 2004. Almost Every Convex or Quadratic Programming Problem Is Well Posed. Mathematics of Operations Research 29, 369-382. https://doi.org/10.1287/moor.1030.0080
American Psychological Association 7th editionIoffe, A. D., Lucchetti, R. E., & Revalski, J. P. (2004). Almost Every Convex or Quadratic Programming Problem Is Well Posed. Mathematics of Operations Research, 29(2), 369-382. https://doi.org/10.1287/moor.1030.0080
Springer - Basic (author-date)Ioffe AD, Lucchetti RE, Revalski JP (2004) Almost Every Convex or Quadratic Programming Problem Is Well Posed.. Mathematics of Operations Research 29:369-382. https://doi.org/10.1287/moor.1030.0080
Juristische Zitierweise (Stüber) (Deutsch)Ioffe, A. D./ Lucchetti, R. E./ Revalski, J. P., Almost Every Convex or Quadratic Programming Problem Is Well Posed., Mathematics of Operations Research 2004, 369-382.