Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Optimization letters, 16.2022, 5, S. 1599-1609
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2021
- Urheber
- DOI
-
10.1007/s11590-021-01802-4
- URN
-
urn:nbn:de:hebis:30:3-897499
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:25 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Harrach, Bastian von
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2021
Ähnliche Objekte (12)
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Convex quadratic and semidefinite programming relaxations in Scheduling
A semidefinite programming approach for robust elliptic localization
Semidefinite representation for convex hulls of real algebraic curves
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Solving elliptic problems using ELLPACK
Semidefinite games
Convex analysis and nonlinear geometric elliptic equations
The Calderón problem with finitely many unknowns is equivalent to convex semidefinite optimization
Solving multiobjective mixed integer convex optimization problems
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Convex quadratic and semidefinite programming relaxations in Scheduling
A semidefinite programming approach for robust elliptic localization
Semidefinite representation for convex hulls of real algebraic curves
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Solving elliptic problems using ELLPACK
Semidefinite games
Convex analysis and nonlinear geometric elliptic equations
The Calderón problem with finitely many unknowns is equivalent to convex semidefinite optimization
Solving multiobjective mixed integer convex optimization problems
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
Convex quadratic and semidefinite programming relaxations in Scheduling
A semidefinite programming approach for robust elliptic localization
Semidefinite representation for convex hulls of real algebraic curves
Solving clustered low-rank semidefinite programs arising from polynomial optimization
Solving elliptic problems using ELLPACK
Semidefinite games
Convex analysis and nonlinear geometric elliptic equations
The Calderón problem with finitely many unknowns is equivalent to convex semidefinite optimization