Solving an inverse elliptic coefficient problem by convex non-linear semidefinite programming
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Optimization letters, 16.2022, 5, S. 1599-1609
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Universitätsbibliothek Johann Christian Senckenberg
- (when)
-
2021
- Creator
- DOI
-
10.1007/s11590-021-01802-4
- URN
-
urn:nbn:de:hebis:30:3-897499
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:25 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Harrach, Bastian von
- Universitätsbibliothek Johann Christian Senckenberg
Time of origin
- 2021
Other Objects (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