{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T19:13:19Z","timestamp":1721157199798},"reference-count":83,"publisher":"Walter de Gruyter GmbH","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11,27]]},"abstract":"<jats:title>Zusammenfassung<\/jats:title>\n               <jats:p>Der vorliegende Beitrag gibt einen \u00dcberblick zur Optimierung, wobei das Problem als solches und nicht die Algorithmen oder konkrete Anwendungen im Mittelpunkt stehen. Die Probleme werden eingeordnet, ihre Grundideen skizziert, und es werden Software-Tools zu ihrer L\u00f6sung genannt. Dar\u00fcber hinaus diskutiert der Beitrag die Frage der Existenz und Eindeutigkeit von L\u00f6sungen f\u00fcr Optimierungsprobleme. Mit Hilfe erweiterter Ableitungskalk\u00fcle werden notwendige Bedingungen f\u00fcr glatte und nichtglatte Zielfunktionen in endlich- und unendlichdimensionalen R\u00e4umen und auf Mannigfaltigkeiten formuliert. Diese mathematisch anspruchsvolleren Darstellungen richten sich an die in der Forschung t\u00e4tigen Ingenieure.<\/jats:p>","DOI":"10.1515\/auto-2018-0081","type":"journal-article","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T09:19:06Z","timestamp":1541668746000},"page":"903-927","source":"Crossref","is-referenced-by-count":1,"title":["Klassifikation von Optimierungsproblemen"],"prefix":"10.1515","volume":"66","author":[{"given":"Lutz","family":"Gr\u00f6ll","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Automation und angewandte Informatik , KIT-Campus Nord , Hermann-von-Helmholtz-Platz 1, 76344 Eggenstein-Leopoldshafen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2018,11,8]]},"reference":[{"key":"2023033120150240175_j_auto-2018-0081_ref_001_w2aab3b7b5b1b6b1ab1b9b1Aa","doi-asserted-by":"crossref","unstructured":"Andersson, J.; \u00c5kesson, J.; Diehl, M.: CasADi: A symbolic package for automatic differentiation and optimal control. In: Recent advances in algorithmic differentiation, Springer, 2012, p.\u2009297\u2013307.","DOI":"10.1007\/978-3-642-30023-3_27"},{"key":"2023033120150240175_j_auto-2018-0081_ref_002_w2aab3b7b5b1b6b1ab1b9b2Aa","doi-asserted-by":"crossref","unstructured":"Ansari, Q.H.; Lalitha, C.S.; Mehta, M.: Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization. CRC Press, 2014.","DOI":"10.1201\/b15244"},{"key":"2023033120150240175_j_auto-2018-0081_ref_003_w2aab3b7b5b1b6b1ab1b9b3Aa","unstructured":"Ben-Israel, A.; Greville, T.N.E.: Generalized inverses: Theory and applications. CMS Books in Mathematics, 2002."},{"key":"2023033120150240175_j_auto-2018-0081_ref_004_w2aab3b7b5b1b6b1ab1b9b4Aa","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A.; Nemirovski, A.: Lectures on modern convex optimization. SIAM, 2001.","DOI":"10.1137\/1.9780898718829"},{"key":"2023033120150240175_j_auto-2018-0081_ref_005_w2aab3b7b5b1b6b1ab1b9b5Aa","unstructured":"Bendersky, M.: The calculus of variations. Lecture notes, 2008, url: math.hunter.cuny.edu\/\u02dcbenders\/cofv.pdf."},{"key":"2023033120150240175_j_auto-2018-0081_ref_006_w2aab3b7b5b1b6b1ab1b9b6Aa","unstructured":"Bertsekas, D.: Nonlinear Programming. Belmont: Athena Scientific, 1999."},{"key":"2023033120150240175_j_auto-2018-0081_ref_007_w2aab3b7b5b1b6b1ab1b9b7Aa","doi-asserted-by":"crossref","unstructured":"Bianchi, L.; Dorigo, M.; Gambardella, L.M.; Gutjahr, W.J.: A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing 8 (2009), p.\u2009239\u2013287.10.1007\/s11047-008-9098-4","DOI":"10.1007\/s11047-008-9098-4"},{"key":"2023033120150240175_j_auto-2018-0081_ref_008_w2aab3b7b5b1b6b1ab1b9b8Aa","unstructured":"Birge, J.R.; Louveaux, F.: Introduction to stochastic programming. New York: Springer, 1997."},{"key":"2023033120150240175_j_auto-2018-0081_ref_009_w2aab3b7b5b1b6b1ab1b9b9Aa","doi-asserted-by":"crossref","unstructured":"Blum, C.; Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35 (2003), p.\u2009268\u2013308.10.1145\/937503.937505","DOI":"10.1145\/937503.937505"},{"key":"2023033120150240175_j_auto-2018-0081_ref_010_w2aab3b7b5b1b6b1ab1b9c10Aa","unstructured":"Bolza, O.: Vorlesungen \u00fcber Variationsrechnung. Leipzig: Verlag von B.G. Teubner, 1909."},{"key":"2023033120150240175_j_auto-2018-0081_ref_011_w2aab3b7b5b1b6b1ab1b9c11Aa","unstructured":"Boyd, S.; Vandenberghe, L.: Convex Optimization. Cambridge University Press, 2008."},{"key":"2023033120150240175_j_auto-2018-0081_ref_012_w2aab3b7b5b1b6b1ab1b9c12Aa","doi-asserted-by":"crossref","unstructured":"Brandwood, D.H.: A complex gradient operator and its application in adaptive array theory. IEE Proc. Theory and Techniques 130 (1983), p.\u200911\u201316.","DOI":"10.1049\/ip-h-1.1983.0004"},{"key":"2023033120150240175_j_auto-2018-0081_ref_013_w2aab3b7b5b1b6b1ab1b9c13Aa","doi-asserted-by":"crossref","unstructured":"B\u00fcskens, C.; Wassel, D.: The ESA NLP solver WORHP. In: Modeling and optimization in space engineering, Springer, 2012, p.\u200985\u2013110.","DOI":"10.1007\/978-1-4614-4469-5_4"},{"key":"2023033120150240175_j_auto-2018-0081_ref_014_w2aab3b7b5b1b6b1ab1b9c14Aa","unstructured":"Cambini, A.; Martein, L.: Generalized convexity and optimality conditions in scalar and vector optimization. In: Handbook of generalized convexity and generalized monotonicity, Springer, 2005, p.\u2009151\u2013194."},{"key":"2023033120150240175_j_auto-2018-0081_ref_015_w2aab3b7b5b1b6b1ab1b9c15Aa","unstructured":"Chachuat, B.C.: Nonlinear and dynamic optimization: From theory to practice. EPFL scientific publications, 2007."},{"key":"2023033120150240175_j_auto-2018-0081_ref_016_w2aab3b7b5b1b6b1ab1b9c16Aa","doi-asserted-by":"crossref","unstructured":"Cramer, J.S.: Econometric applications of Maximum Likelihood methods. Cambridge University Press, 1986.","DOI":"10.1017\/CBO9780511572050"},{"key":"2023033120150240175_j_auto-2018-0081_ref_017_w2aab3b7b5b1b6b1ab1b9c17Aa","doi-asserted-by":"crossref","unstructured":"Crouzeix, J.-P.: Criteria for generalized convexity and generalized monotonicity in the differentiable case. In: Handbook of generalized convexity and generalized monotonicity, Springer, 2005, p.\u200989\u2013119.","DOI":"10.1007\/0-387-23393-8_2"},{"key":"2023033120150240175_j_auto-2018-0081_ref_018_w2aab3b7b5b1b6b1ab1b9c18Aa","unstructured":"Dattorro, J.: Convex optimization & Euclidean distance geometry. Meboo Publishing USA, 2005."},{"key":"2023033120150240175_j_auto-2018-0081_ref_019_w2aab3b7b5b1b6b1ab1b9c19Aa","unstructured":"Dempe, S.: Foundations of bilevel programming. New York: Kluwer Academic Publisher, 2002."},{"key":"2023033120150240175_j_auto-2018-0081_ref_020_w2aab3b7b5b1b6b1ab1b9c20Aa","doi-asserted-by":"crossref","unstructured":"Dem\u2019yanov, V.F.; Stavroulakis, G.E.; Polyakova, L.N.; Panagiotopoulos, P.D.: Quasidifferentiability and nonsmooth modelling in mechanics, engineering and economics. Dordrecht: Springer Science+Business Media, 1996.","DOI":"10.1007\/978-1-4615-4113-4"},{"key":"2023033120150240175_j_auto-2018-0081_ref_021_w2aab3b7b5b1b6b1ab1b9c21Aa","doi-asserted-by":"crossref","unstructured":"Deutsch, F.: Best approximation in inner product spaces. New York: Springer-Verlag, 2001.","DOI":"10.1007\/978-1-4684-9298-9"},{"key":"2023033120150240175_j_auto-2018-0081_ref_022_w2aab3b7b5b1b6b1ab1b9c22Aa","doi-asserted-by":"crossref","unstructured":"Edelman, A.; Arias, T.A.; Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20 (1998), p.\u2009303\u2013353.10.1137\/S0895479895290954","DOI":"10.1137\/S0895479895290954"},{"key":"2023033120150240175_j_auto-2018-0081_ref_023_w2aab3b7b5b1b6b1ab1b9c23Aa","unstructured":"Ehrgott, M.: Multicriteria optimization. Berlin: Springer-Verlag, 2005."},{"key":"2023033120150240175_j_auto-2018-0081_ref_024_w2aab3b7b5b1b6b1ab1b9c24Aa","doi-asserted-by":"crossref","unstructured":"Flett, T.M.: Differential analysis. Cambridge: Cambridge University Press, 1980.","DOI":"10.1017\/CBO9780511897191"},{"key":"2023033120150240175_j_auto-2018-0081_ref_025_w2aab3b7b5b1b6b1ab1b9c25Aa","doi-asserted-by":"crossref","unstructured":"Floudas, C.A.; Pardarlos, P.M.: Encyclopedia of optimization. Springer, 2009.","DOI":"10.1007\/978-0-387-74759-0"},{"key":"2023033120150240175_j_auto-2018-0081_ref_026_w2aab3b7b5b1b6b1ab1b9c26Aa","doi-asserted-by":"crossref","unstructured":"Fradkov, A.L.; Miroshnik, I.V.; Nikiforov, V.O.: Nonlinear and adaptive control of complex systems. Dordrecht: Springer Science+Business Media, 1999.","DOI":"10.1007\/978-94-015-9261-1"},{"key":"2023033120150240175_j_auto-2018-0081_ref_027_w2aab3b7b5b1b6b1ab1b9c27Aa","doi-asserted-by":"crossref","unstructured":"Fridman, E.: Introduction to time-delay systems: Analysis and control. Springer International Publishing, 2014.","DOI":"10.1007\/978-3-319-09393-2"},{"key":"2023033120150240175_j_auto-2018-0081_ref_028_w2aab3b7b5b1b6b1ab1b9c28Aa","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B.; Matou\u0161ek, J.: Approximation algorithms and semidefinite programming. Berlin: Springer-Verlag, 2012.","DOI":"10.1007\/978-3-642-22015-9"},{"key":"2023033120150240175_j_auto-2018-0081_ref_029_w2aab3b7b5b1b6b1ab1b9c29Aa","doi-asserted-by":"crossref","unstructured":"Geiger, M.J.: Multikriterielle Ablaufplanung. Wiesbaden: Deutscher Universit\u00e4ts-Verlag, 2005.","DOI":"10.1007\/978-3-322-82174-4"},{"key":"2023033120150240175_j_auto-2018-0081_ref_030_w2aab3b7b5b1b6b1ab1b9c30Aa","doi-asserted-by":"crossref","unstructured":"Gelashvili, K.: The existence of optimal control on the basis of Weierstrass\u2019s theorem. J. of Mathematical Sciences 177 (2011), p.\u2009373\u2013382.10.1007\/s10958-011-0463-y","DOI":"10.1007\/s10958-011-0463-y"},{"key":"2023033120150240175_j_auto-2018-0081_ref_031_w2aab3b7b5b1b6b1ab1b9c31Aa","doi-asserted-by":"crossref","unstructured":"Gentle, J.E.: Matrix algebra. New York: Springer Science+Business Media, 2007.","DOI":"10.1007\/978-0-387-70873-7"},{"key":"2023033120150240175_j_auto-2018-0081_ref_032_w2aab3b7b5b1b6b1ab1b9c32Aa","doi-asserted-by":"crossref","unstructured":"Gerdts, M.: Optimal Control of ODEs and DAEs. De Gruyter, 2012.","DOI":"10.1515\/9783110249996"},{"key":"2023033120150240175_j_auto-2018-0081_ref_033_w2aab3b7b5b1b6b1ab1b9c33Aa","doi-asserted-by":"crossref","unstructured":"Gill, P.E.; Murray, W.; Saunders, M.A.: SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM review 47 (2005), p.\u200999\u2013131.10.1137\/S0036144504446096","DOI":"10.1137\/S0036144504446096"},{"key":"2023033120150240175_j_auto-2018-0081_ref_034_w2aab3b7b5b1b6b1ab1b9c34Aa","unstructured":"Giorgi, J.; Gwirraggio, A.; Thierselder, J.: Mathematics of optimization, smooth and nonsmooth cases. Elsevier, 2004."},{"key":"2023033120150240175_j_auto-2018-0081_ref_035_w2aab3b7b5b1b6b1ab1b9c35Aa","unstructured":"Grant, M.C.; Boyd, S.P.: The CVX Users\u2019 Guide. 2017, http:\/\/cvxr.com\/cvx\/doc\/CVX.pdf."},{"key":"2023033120150240175_j_auto-2018-0081_ref_036_w2aab3b7b5b1b6b1ab1b9c36Aa","doi-asserted-by":"crossref","unstructured":"Griva, I.; Nash, S.K.; Sofer, A.: Linear and nonlinear optimization. Philadelphia: SIAM, 2009.","DOI":"10.1137\/1.9780898717730"},{"key":"2023033120150240175_j_auto-2018-0081_ref_037_w2aab3b7b5b1b6b1ab1b9c37Aa","unstructured":"Gr\u00f6ll, L.: Methodik zur Integration von Vorwissen in die Modellbildung. Karlsruhe: KIT Scientific Publishing, 2015."},{"key":"2023033120150240175_j_auto-2018-0081_ref_038_w2aab3b7b5b1b6b1ab1b9c38Aa","unstructured":"Gromicho, J.A.d.S.: Quasiconvex optimization and location theory. Kluwer Academic Publishing, 1998."},{"key":"2023033120150240175_j_auto-2018-0081_ref_039_w2aab3b7b5b1b6b1ab1b9c39Aa","doi-asserted-by":"crossref","unstructured":"Hauswirth, A.; Zanardi, A.; Bolognani, S.; D\u00f6rfler, F.; Hug, G.: Online optimization in closed loop on the power flow manifold. IEEE PowerTech, 2017, p.\u20091\u20136.","DOI":"10.1109\/PTC.2017.7980998"},{"key":"2023033120150240175_j_auto-2018-0081_ref_040_w2aab3b7b5b1b6b1ab1b9c40Aa","doi-asserted-by":"crossref","unstructured":"Hestenes, M.R.: Sufficient conditions for multiple integral problems in the calculus of variations. Amer. J. Math. 70 (1948), p.\u2009239\u2013276.10.2307\/2372325","DOI":"10.2307\/2372325"},{"key":"2023033120150240175_j_auto-2018-0081_ref_041_w2aab3b7b5b1b6b1ab1b9c41Aa","doi-asserted-by":"crossref","unstructured":"Ioffe, A.: Nonconvex subdifferentials. In: Clarke, F.H.; Dem\u2019yanov, V.F.; Giannessi, F.: Nonsmooth optimization and related topics, NY: Springer, 1989, p.\u2009241\u2013254.","DOI":"10.1007\/978-1-4757-6019-4_14"},{"key":"2023033120150240175_j_auto-2018-0081_ref_042_w2aab3b7b5b1b6b1ab1b9c42Aa","doi-asserted-by":"crossref","unstructured":"Jarre, F.; Stoer, J.: Optimierung. Berlin: Springer-Verlag, 2004.","DOI":"10.1007\/978-3-642-18785-8"},{"key":"2023033120150240175_j_auto-2018-0081_ref_043_w2aab3b7b5b1b6b1ab1b9c43Aa","unstructured":"Kall, P.; Wallace, S.W.: Stochastic programming. Chichester: Wiley, 1994."},{"key":"2023033120150240175_j_auto-2018-0081_ref_044_w2aab3b7b5b1b6b1ab1b9c44Aa","doi-asserted-by":"crossref","unstructured":"Kallrath, J.: Gemischt-ganzzahlige Optimierung: Modellierung in der Praxis. Wiesbaden: Springer Fachmedien, 2013.","DOI":"10.1007\/978-3-658-00690-7"},{"key":"2023033120150240175_j_auto-2018-0081_ref_045_w2aab3b7b5b1b6b1ab1b9c45Aa","unstructured":"Kanzi, N.: Mangasarian-Fromovitz and Zangwill conditions for non-smooth infinite optimization problems in Banach spaces. Iranian Journal of Mathematical Sciences and Informatics 10 (2015), p.\u200911\u201322."},{"key":"2023033120150240175_j_auto-2018-0081_ref_046_w2aab3b7b5b1b6b1ab1b9c46Aa","unstructured":"Korte, B.; Vygen, J.: Combinatorial optimization. Berlin: Springer-Verlag, 2006."},{"key":"2023033120150240175_j_auto-2018-0081_ref_047_w2aab3b7b5b1b6b1ab1b9c47Aa","doi-asserted-by":"crossref","unstructured":"Kostyukova, O.; Tchemisova, T.: Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets. JOTA 175 (2017), p.\u200976\u2013103.10.1007\/s10957-017-1150-z","DOI":"10.1007\/s10957-017-1150-z"},{"key":"2023033120150240175_j_auto-2018-0081_ref_048_w2aab3b7b5b1b6b1ab1b9c48Aa","unstructured":"Krsti\u0107, M.; Kanellakopoulos, I; Kokotovi\u0107, P.: Nonlinear and adaptive control design. New York: John Wiley & Sons, 1995."},{"key":"2023033120150240175_j_auto-2018-0081_ref_049_w2aab3b7b5b1b6b1ab1b9c49Aa","doi-asserted-by":"crossref","unstructured":"Lampariello, L.; Sagratella, S.: A bridge between bilevel programs and Nash games. Journal of Optimization Theory and Applications 174 (2017), p.\u2009613\u2013635.10.1007\/s10957-017-1109-0","DOI":"10.1007\/s10957-017-1109-0"},{"key":"2023033120150240175_j_auto-2018-0081_ref_050_w2aab3b7b5b1b6b1ab1b9c50Aa","doi-asserted-by":"crossref","unstructured":"Liberzon, D.: Calculus of variations and optimal control theory. A concise introduction. Princeton University Press, 2012.","DOI":"10.1515\/9781400842643"},{"key":"2023033120150240175_j_auto-2018-0081_ref_051_w2aab3b7b5b1b6b1ab1b9c51Aa","doi-asserted-by":"crossref","unstructured":"Lieb, I.; Fischer, W.: Funktionentheorie: Komplexe Analysis in einer Ver\u00e4nderlichen. Vieweg & Teubner, 2005.","DOI":"10.1007\/978-3-322-94118-3_3"},{"key":"2023033120150240175_j_auto-2018-0081_ref_052_w2aab3b7b5b1b6b1ab1b9c52Aa","doi-asserted-by":"crossref","unstructured":"Liu, B.; Wei, W.; Liu, F.: Locating all real solutions of power flow equations: A convex optimization based method. IET Generation Transmission & Distribution, https:\/\/arxiv.org\/abs\/1711.10213, 2018.","DOI":"10.1049\/iet-gtd.2017.1870"},{"key":"2023033120150240175_j_auto-2018-0081_ref_053_w2aab3b7b5b1b6b1ab1b9c53Aa","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: IEEE International Symposium on Computer Aided Control Systems Design, 2004, p.\u2009284\u2013289."},{"key":"2023033120150240175_j_auto-2018-0081_ref_054_w2aab3b7b5b1b6b1ab1b9c54Aa","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, M.; Still, G.: Semi-infinite programming. European J. of Operations Research 180 (2007), p.\u2009491\u2013518.10.1016\/j.ejor.2006.08.045","DOI":"10.1016\/j.ejor.2006.08.045"},{"key":"2023033120150240175_j_auto-2018-0081_ref_055_w2aab3b7b5b1b6b1ab1b9c55Aa","unstructured":"Luenberger, D.G.: Optimization by vector space methods. New York: John Wiley & Sons, 1969."},{"key":"2023033120150240175_j_auto-2018-0081_ref_056_w2aab3b7b5b1b6b1ab1b9c56Aa","unstructured":"Magnus, J.R.; Neudecker, H.: Matrix differential calculus with applications in statistics and econometrics. Chichester: John Wiley & Sons Ltd, 1999."},{"key":"2023033120150240175_j_auto-2018-0081_ref_057_w2aab3b7b5b1b6b1ab1b9c57Aa","doi-asserted-by":"crossref","unstructured":"M\u00e4kel\u00e4, M.M.; Neittaanm\u00e4ki, P.: Nonsmooth Optimization: Analysis and algorithms with application to optimal control. World Scientific, 1992.","DOI":"10.1142\/1493"},{"key":"2023033120150240175_j_auto-2018-0081_ref_058_w2aab3b7b5b1b6b1ab1b9c58Aa","doi-asserted-by":"crossref","unstructured":"McCormick, S.T.: Submodular function minimization. In: Handbooks in operations research and management science: Discrete optimization, 2005, p.\u2009321\u2013391.","DOI":"10.1016\/S0927-0507(05)12007-6"},{"key":"2023033120150240175_j_auto-2018-0081_ref_059_w2aab3b7b5b1b6b1ab1b9c59Aa","unstructured":"Mishra, S.K.; Wang, S.-Y.; Lai, K.K.: Generalized convexity and vector optimization. Berlin: Springer-Verlag, 2009."},{"key":"2023033120150240175_j_auto-2018-0081_ref_060_w2aab3b7b5b1b6b1ab1b9c60Aa","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational analysis and generalized differentiation. Berlin: Springer-Verlag, 2006.","DOI":"10.1007\/3-540-31246-3"},{"key":"2023033120150240175_j_auto-2018-0081_ref_061_w2aab3b7b5b1b6b1ab1b9c61Aa","unstructured":"Muthukumar, T.: Sobolev spaces and applications. 2016."},{"key":"2023033120150240175_j_auto-2018-0081_ref_062_w2aab3b7b5b1b6b1ab1b9c62Aa","unstructured":"Nazarkandi, H.A.: Downward sets and their topological properties. World Applied Sciences Journal 18 (2012), p.\u20091630\u20131634."},{"key":"2023033120150240175_j_auto-2018-0081_ref_063_w2aab3b7b5b1b6b1ab1b9c63Aa","doi-asserted-by":"crossref","unstructured":"Ortega, J.M.; Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables. Philadelphia: SIAM, 2000.","DOI":"10.1137\/1.9780898719468"},{"key":"2023033120150240175_j_auto-2018-0081_ref_064_w2aab3b7b5b1b6b1ab1b9c64Aa","doi-asserted-by":"crossref","unstructured":"Parring, A.-M.: About the concept of the matrix derivative. Linear Algebra Appl. 176 (1992), p.\u2009223\u2013235.10.1016\/0024-3795(92)90220-5","DOI":"10.1016\/0024-3795(92)90220-5"},{"key":"2023033120150240175_j_auto-2018-0081_ref_065_w2aab3b7b5b1b6b1ab1b9c65Aa","unstructured":"Petersen, K.B.; Pedersen, M.S.: The matrix cookbook. 2008, url: https:\/\/www.math.uwaterloo.ca\/\u02dchwolkowi\/matrixcookbook.pdf."},{"key":"2023033120150240175_j_auto-2018-0081_ref_066_w2aab3b7b5b1b6b1ab1b9c66Aa","doi-asserted-by":"crossref","unstructured":"Quirynen, R.; Vukov, M.; Zanon, M.; Diehl, M.: Autogenerating microsecond solvers for nonlinear MPC: A tutorial using ACADO integrators. Optimal Control Applications and Methods 36 (2015), p.\u2009685\u2013704.10.1002\/oca.2152","DOI":"10.1002\/oca.2152"},{"key":"2023033120150240175_j_auto-2018-0081_ref_067_w2aab3b7b5b1b6b1ab1b9c67Aa","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton, New Jersey: Princeton University Press, 1970."},{"key":"2023033120150240175_j_auto-2018-0081_ref_068_w2aab3b7b5b1b6b1ab1b9c68Aa","unstructured":"Schwartz, L.: Cours d\u2019Analyse. Paris: Hermann, 1967."},{"key":"2023033120150240175_j_auto-2018-0081_ref_069_w2aab3b7b5b1b6b1ab1b9c69Aa","doi-asserted-by":"crossref","unstructured":"Shapiro, H.: Topics in approximation theory. Springer, 1971.","DOI":"10.1007\/BFb0058976"},{"key":"2023033120150240175_j_auto-2018-0081_ref_070_w2aab3b7b5b1b6b1ab1b9c70Aa","doi-asserted-by":"crossref","unstructured":"Shikhman, V.: Topological aspects of nonsmooth optimization. Springe Science + Business Media, 2012.","DOI":"10.1007\/978-1-4614-1897-9"},{"key":"2023033120150240175_j_auto-2018-0081_ref_071_w2aab3b7b5b1b6b1ab1b9c71Aa","doi-asserted-by":"crossref","unstructured":"Simons, S.: Minimax theorems and their proofs. In: Minimax and applications, Kluwer Academic Publishers, 1995, p.\u20091\u201323.","DOI":"10.1007\/978-1-4613-3557-3_1"},{"key":"2023033120150240175_j_auto-2018-0081_ref_072_w2aab3b7b5b1b6b1ab1b9c72Aa","doi-asserted-by":"crossref","unstructured":"Singer, I.: Best approximation in normed linear spaces by elements of linear subspaces. New York: Springer-Verlag, 1970.","DOI":"10.1007\/978-3-662-41583-2"},{"key":"2023033120150240175_j_auto-2018-0081_ref_073_w2aab3b7b5b1b6b1ab1b9c73Aa","doi-asserted-by":"crossref","unstructured":"Soltani, Z.; Goudarzi, H.R.: Best approximation by upward sets. J. of mathematics and computer science 14 (2015), p.\u2009345\u2013353.10.22436\/jmcs.014.04.08","DOI":"10.22436\/jmcs.014.04.08"},{"key":"2023033120150240175_j_auto-2018-0081_ref_074_w2aab3b7b5b1b6b1ab1b9c74Aa","doi-asserted-by":"crossref","unstructured":"Spille, B.; Weismantel, R.: Primal integer programming. In: Handbooks in operations research and management science: Discrete optimization, 2005, p.\u2009245\u2013276.","DOI":"10.1016\/S0927-0507(05)12005-2"},{"key":"2023033120150240175_j_auto-2018-0081_ref_075_w2aab3b7b5b1b6b1ab1b9c75Aa","doi-asserted-by":"crossref","unstructured":"Stancu-Minasian, I.M.: Fractional programming. Dordrecht: Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-94-009-0035-6"},{"key":"2023033120150240175_j_auto-2018-0081_ref_076_w2aab3b7b5b1b6b1ab1b9c76Aa","doi-asserted-by":"crossref","unstructured":"Stickel, E.: On the Fr\u00e9chet derivative of matrix functions. Linear Algebra Appl. 91 (1987), p.\u200983\u201388.10.1016\/0024-3795(87)90062-0","DOI":"10.1016\/0024-3795(87)90062-0"},{"key":"2023033120150240175_j_auto-2018-0081_ref_077_w2aab3b7b5b1b6b1ab1b9c77Aa","doi-asserted-by":"crossref","unstructured":"Taheri, A.: Sufficiency theorems for local minimizers of the multiple integrals of the calculus of variations. Proc. of the Royal Society of Edinburgh 131A (2001), p.\u2009155\u2013184.","DOI":"10.1017\/S0308210500000822"},{"key":"2023033120150240175_j_auto-2018-0081_ref_078_w2aab3b7b5b1b6b1ab1b9c78Aa","doi-asserted-by":"crossref","unstructured":"Udriste, C.: Convex functions and optimization methods on Riemannian manifolds. Springer-Science + Business Media, 1994.","DOI":"10.1007\/978-94-015-8390-9"},{"key":"2023033120150240175_j_auto-2018-0081_ref_079_w2aab3b7b5b1b6b1ab1b9c79Aa","unstructured":"Varfolomeev, A.: Zur Ableitung skalarer Funktionen nach einem symmetrischen Matrixargument (in Russisch). Techn. Bericht, Universit\u00e4t von Petrosavod, 1995."},{"key":"2023033120150240175_j_auto-2018-0081_ref_080_w2aab3b7b5b1b6b1ab1b9c80Aa","doi-asserted-by":"crossref","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Review 57 (2015), p.\u20093\u201357.10.1137\/130915303","DOI":"10.1137\/130915303"},{"key":"2023033120150240175_j_auto-2018-0081_ref_081_w2aab3b7b5b1b6b1ab1b9c81Aa","doi-asserted-by":"crossref","unstructured":"W\u00e4chter, A.; Biegler, L.T.: On the implementation of primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Mathematical Programming 106 (2006), p.\u200925\u201357.10.1007\/s10107-004-0559-y","DOI":"10.1007\/s10107-004-0559-y"},{"key":"2023033120150240175_j_auto-2018-0081_ref_082_w2aab3b7b5b1b6b1ab1b9c82Aa","doi-asserted-by":"crossref","unstructured":"Waibel, P.; Matthes, J.; Gr\u00f6ll, L.: Constrained ellipse fitting with center on a line. Journal of Mathematical Imaging and Vision 53 (2015), p.\u2009364\u2013382.10.1007\/s10851-015-0584-x","DOI":"10.1007\/s10851-015-0584-x"},{"key":"2023033120150240175_j_auto-2018-0081_ref_083_w2aab3b7b5b1b6b1ab1b9c83Aa","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H.; Saigal, R.; Vandenberghe, L.: Handbook of semidefinite programming: Theory, algorithms, and applications. Springer, 2000.","DOI":"10.1007\/978-1-4615-4381-7"}],"container-title":["at - Automatisierungstechnik"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/auto.2018.66.issue-11\/auto-2018-0081\/auto-2018-0081.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2018-0081\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2018-0081\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T08:48:17Z","timestamp":1680338897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/auto-2018-0081\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,1]]},"references-count":83,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11,8]]},"published-print":{"date-parts":[[2018,11,27]]}},"alternative-id":["10.1515\/auto-2018-0081"],"URL":"https:\/\/doi.org\/10.1515\/auto-2018-0081","relation":{},"ISSN":["2196-677X","0178-2312"],"issn-type":[{"value":"2196-677X","type":"electronic"},{"value":"0178-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2018,11,1]]}}}