default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Laurain
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Ernesto G. Birgin
, John L. C. Gardenghi, Antoine Laurain:
Bounds on the Optimal Radius When Covering a Set with Minimum Radius Identical Disks. Math. Oper. Res. 49(3): 1855-1889 (2024)- 2023
- [j21]Ernesto G. Birgin, Antoine Laurain, T. Menezes:
Sensitivity analysis and tailored design of minimization diagrams. Math. Comput. 92(344): 2715-2768 (2023) - 2022
- [j20]Ernesto G. Birgin, Antoine Laurain, Rafael Massambone, Arthur G. Santana:
A Shape-Newton Approach to the Problem of Covering with Identical Balls. SIAM J. Sci. Comput. 44(2): 798- (2022) - 2021
- [j19]Antoine Laurain, Shawn W. Walker:
Optimal control of volume-preserving mean curvature flow. J. Comput. Phys. 438: 110373 (2021) - [j18]Yuri F. Albuquerque, Antoine Laurain, Irwin Yousept:
Level Set-Based Shape Optimization Approach for Sharp-Interface Reconstructions in Time-Domain Full Waveform Inversion. SIAM J. Appl. Math. 81(3): 939-964 (2021) - [j17]Antoine Laurain, Malte Winckler, Irwin Yousept:
Shape Optimization for Superconductors Governed by H(curl)-Elliptic Variational Inequalities. SIAM J. Control. Optim. 59(3): 2247-2272 (2021) - [j16]Ernesto G. Birgin, Antoine Laurain, Rafael Massambone, Arthur G. Santana:
A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls. SIAM J. Sci. Comput. 43(3): A2047-A2078 (2021) - [i2]Antoine Laurain:
Analysis and application of a lower envelope method for sharp-interface multiphase problems. CoRR abs/2112.02401 (2021) - 2020
- [i1]Antoine Laurain, Malte Winckler, Irwin Yousept:
Shape optimization for superconductors governed by H(curl)-elliptic variational inequalities. CoRR abs/2006.09903 (2020)
2010 – 2019
- 2018
- [j15]Antoine Laurain:
Analyzing Smooth and Singular Domain Perturbations in Level Set Methods. SIAM J. Math. Anal. 50(4): 4327-4370 (2018) - 2017
- [j14]Antoine Laurain:
Stability Analysis of the Reconstruction Step of the Voronoi Implicit Interface Method. SIAM J. Numer. Anal. 55(1): 1-30 (2017) - 2015
- [j13]Antoine Laurain, Shawn W. Walker:
Droplet Footprint Control. SIAM J. Control. Optim. 53(2): 771-799 (2015) - [j12]Peter Gangl, Ulrich Langer, Antoine Laurain, Houcine Meftahi, Kevin Sturm:
Shape Optimization of an Electric Motor Subject to Nonlinear Magnetostatics. SIAM J. Sci. Comput. 37(6) (2015) - 2014
- [j11]Alfredo Canelas, Antoine Laurain, Antonio André Novotny:
A new reconstruction method for the inverse potential problem. J. Comput. Phys. 268: 417-431 (2014) - 2013
- [j10]Samuel Amstutz, Antoine Laurain:
A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints. Comput. Optim. Appl. 56(2): 369-403 (2013) - 2012
- [j9]Michael Hintermüller, Antoine Laurain, Antonio André Novotny:
Second-order topological expansion for electrical impedance tomography. Adv. Comput. Math. 36(2): 235-265 (2012) - [j8]Stephen L. Keeling, Christian Clason, Michael Hintermüller, Florian Knoll, Antoine Laurain, Gregory von Winckel:
An image space approach to Cartesian based parallel MR imaging with total variation regularization. Medical Image Anal. 16(1): 189-200 (2012) - [j7]Carlos Conca, Antoine Laurain, Rajesh Mahadevan:
Minimization of the Ground State for Two Phase Conductors in Low Contrast Regime. SIAM J. Appl. Math. 72(4): 1238-1259 (2012) - 2011
- [j6]Stephen L. Keeling, Michael Hintermüller, Florian Knoll, Daniel Kraft, Antoine Laurain:
A total variation based approach to correcting surface coil magnetic resonance images. Appl. Math. Comput. 218(2): 219-232 (2011) - [j5]Michael Hintermüller, Antoine Laurain:
Optimal Shape Design Subject to Elliptic Variational Inequalities. SIAM J. Control. Optim. 49(3): 1015-1047 (2011) - 2010
- [j4]Michael Hintermüller, Antoine Laurain:
A shape and topology optimization technique for solving a class of linear complementarity problems in function space. Comput. Optim. Appl. 46(3): 535-569 (2010)
2000 – 2009
- 2009
- [j3]Michael Hintermüller, Antoine Laurain:
Multiphase Image Segmentation and Modulation Recovery Based on Shape and Topological Sensitivity. J. Math. Imaging Vis. 35(1): 1-22 (2009) - 2008
- [j2]Piotr Fulmanski, Antoine Laurain, Jean-François Scheid, Jan Sokolowski:
Level set method with topological derivatives in shape optimization. Int. J. Comput. Math. 85(10): 1491-1514 (2008) - 2007
- [j1]Piotr Fulmanski, Antoine Laurain, Jean-François Scheid, Jan Sokolowski:
A Level Set Method in Shape and Topology Optimization for Variational Inequalities. Int. J. Appl. Math. Comput. Sci. 17(3): 413-430 (2007) - [c1]Antoine Laurain, Katarzyna Szulc:
Using Self-adjoint Extensions in Shape Optimization. System Modelling and Optimization 2007: 331-349
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
