default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian A. Potra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j54]Daniel Faccini
, Francesca Maggioni, Florian A. Potra:
Robust and Distributionally Robust Optimization Models for Linear Support Vector Machine. Comput. Oper. Res. 147: 105930 (2022)- 2020
- [j53]Andrea Caliciotti, Giovanni Fasano, Florian A. Potra, Massimo Roma:
Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton's equation. Comput. Optim. Appl. 77(3): 627-651 (2020) - [j52]Soodabeh Asadi, Zsolt Darvay, Goran Lesaja, Nezam Mahdavi-Amiri, Florian A. Potra:
A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems. J. Optim. Theory Appl. 186(3): 864-878 (2020)
2010 – 2019
- 2019
- [j51]Cosmin G. Petra, Florian A. Potra:
A homogeneous model for monotone mixed horizontal linear complementarity problems. Comput. Optim. Appl. 72(1): 241-267 (2019) - [j50]Goran Lesaja, Florian A. Potra:
Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP. Optim. Methods Softw. 34(5): 1014-1034 (2019) - 2017
- [j49]Francesca Maggioni, Florian A. Potra, Marida Bertocchi:
A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches. Comput. Manag. Sci. 14(1): 5-44 (2017) - [j48]Florian A. Potra:
A Superquadratic Variant of Newton's Method. SIAM J. Numer. Anal. 55(6): 2863-2884 (2017) - 2016
- [j47]Florian A. Potra:
Sufficient weighted complementarity problems. Comput. Optim. Appl. 64(2): 467-488 (2016) - 2014
- [j46]Florian A. Potra:
Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity. SIAM J. Optim. 24(1): 1-28 (2014) - 2013
- [j45]Francesca Maggioni, Florian A. Potra, Marida Bertocchi:
Optimal Kinematics of a Looped Filament. J. Optim. Theory Appl. 159(2): 489-506 (2013) - 2012
- [j44]Florian A. Potra:
Weighted Complementarity Problems - A New Paradigm for Computing Equilibria. SIAM J. Optim. 22(4): 1634-1654 (2012) - 2011
- [j43]Filiz Gürtuna, Cosmin G. Petra, Florian A. Potra, Olena Shevchenko, Adrian Vancea:
Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48(3): 453-485 (2011)
2000 – 2009
- 2009
- [j42]Cosmin G. Petra, Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra:
A computational study of the use of an optimization-based method for simulating large multibody systems. Optim. Methods Softw. 24(6): 871-894 (2009) - [j41]Florian A. Potra, Josef Stoer:
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP. SIAM J. Optim. 20(3): 1333-1363 (2009) - 2008
- [j40]Jun Ji, Florian A. Potra:
On the probabilistic complexity of finding an approximate solution for linear programming. J. Complex. 24(2): 214-227 (2008) - [j39]Florian A. Potra:
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path. Math. Program. 111(1-2): 243-272 (2008) - [j38]Florian A. Potra:
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems. SIAM J. Optim. 19(1): 114-143 (2008) - [j37]Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra:
Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics. SIAM J. Optim. 19(2): 969-1001 (2008) - 2007
- [j36]Florian A. Potra:
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(ÖnL)-iteration complexity. Math. Program. 110(2): 443-444 (2007) - [j35]Florian A. Potra, Xing Liu:
Protein image alignment via tensor product cubic splines. Optim. Methods Softw. 22(1): 155-168 (2007) - 2006
- [j34]Florian A. Potra, Xing Liu, Françoise Seillier-Moiseiwitsch, Anindya Roy, Yaming Hang, Mark R. Marten, Babu Raman, Carol Whisnant:
Protein Image Alignment via Piecewise Affine Transformations. J. Comput. Biol. 13(3): 614-630 (2006) - [j33]Florian A. Potra, Xing Liu:
Aligning Families of Two-Dimensional Gels by a Combined Multiresolution Forward-Inverse Transformation Approach. J. Comput. Biol. 13(7): 1384-1395 (2006) - [j32]Florian A. Potra, Xing Liu:
Erratum: predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 21(4): 677-678 (2006) - [j31]Xing Liu, Florian A. Potra:
Corrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path. SIAM J. Optim. 17(3): 871-890 (2006) - 2005
- [j30]Florian A. Potra:
The Kantorovich Theorem and interior point methods. Math. Program. 102(1): 47-70 (2005) - [j29]Florian A. Potra, Xing Liu:
Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 20(1): 145-168 (2005) - 2004
- [j28]Florian A. Potra:
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity. Math. Program. 100(2): 317-337 (2004) - 2002
- [j27]Florian A. Potra:
The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path. Eur. J. Oper. Res. 143(2): 257-267 (2002) - [j26]Götz Alefeld, Xiaojun Chen, Florian A. Potra:
Numerical validation of solutions of complementarity The nonlinear case. Numerische Mathematik 92(1): 1-16 (2002) - 2001
- [j25]Florian A. Potra:
Q-superlinear convergence of the iterates in primal-dual interior-point methods. Math. Program. 91(1): 99-115 (2001)
1990 – 1999
- 1999
- [j24]Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye:
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming. Math. Oper. Res. 24(1): 176-192 (1999) - [j23]Götz Alefeld, Xiaojun Chen, Florian A. Potra:
Numerical validation of solutions of linear complementarity problems. Numerische Mathematik 83(1): 1-23 (1999) - [j22]Nathan W. Brixius, Florian A. Potra, Rongqin Sheng:
Nonsymmetric Search Directions for Semidefinite Programming. SIAM J. Optim. 9(4): 863-876 (1999) - [j21]Jun Ji, Florian A. Potra, Rongqin Sheng:
On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming. SIAM J. Optim. 10(1): 195-210 (1999) - 1998
- [j20]Florian A. Potra, Rongqin Sheng:
A path following method for LCP withsuperlinearly convergent iteration sequence. Ann. Oper. Res. 81: 97-114 (1998) - [j19]Florian A. Potra, Liqun Qi, Defeng Sun:
Secant methods for semismooth equations. Numerische Mathematik 80(2): 305-324 (1998) - [j18]María D. González-Lima, Richard A. Tapia, Florian A. Potra:
On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods. SIAM J. Optim. 8(1): 1-25 (1998) - [j17]Florian A. Potra, Rongqin Sheng:
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming. SIAM J. Optim. 8(4): 1007-1028 (1998) - 1997
- [j16]J. Frédéric Bonnans, Florian A. Potra:
On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems. Math. Oper. Res. 22(2): 378-407 (1997) - [j15]Rongqin Sheng, Florian A. Potra:
A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity. SIAM J. Optim. 7(2): 304-317 (1997) - [j14]Florian A. Potra, Rongqin Sheng:
A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP. SIAM J. Optim. 7(2): 318-335 (1997) - [j13]Laurent O. Jay, Adrian Sandu, Florian A. Potra, Gregory R. Carmichael:
Improved Quasi-Steady-State-Approximation Methods for Atmospheric Chemistry Integration. SIAM J. Sci. Comput. 18(1): 182-202 (1997) - [j12]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
The role of linear semi-infinite programming in signal-adapted QMF bank design. IEEE Trans. Signal Process. 45(9): 2160-2174 (1997) - 1996
- [j11]Florian A. Potra:
AnO(nL) infeasible-interior-point algorithm for LCP with quadratic convergence. Ann. Oper. Res. 62(1): 81-102 (1996) - [j10]Florian A. Potra, Rongqin Sheng:
Predictor-corrector algorithm for solving P*(k)-matrix LCP from arbitrary positive starting points. Math. Program. 76: 223-244 (1996) - [j9]Florian A. Potra:
An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming. SIAM J. Optim. 6(1): 19-32 (1996) - [c2]Pierre Moulin, Mihai Anitescu, Kenneth O. Kortanek, Florian A. Potra:
Design of signal-adapted FIR paraunitary filter banks. ICASSP 1996: 1519-1522 - [c1]George F. Corliss, Andreas Griewank, Petra Henneberger, Gabriela Kirlinger, Florian A. Potra, Hans J. Stetter:
High-Order Stiff ODE Solvers via Automatic Differentiation and Rational Prediction. WNAA 1996: 114-125 - 1995
- [j8]Götz Alefeld, Florian A. Potra, Yixun Shi:
Algorithm 748: Enclosing Zeros of Continuous Functions. ACM Trans. Math. Softw. 21(3): 327-344 (1995) - 1994
- [j7]Florian A. Potra:
Efficient Hybrid Algorithms for Finding Zeros of Convex Functions. J. Complex. 10(2): 199-215 (1994) - [j6]Florian A. Potra:
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67: 383-406 (1994) - 1993
- [j5]Yin Zhang, Richard A. Tapia, Florian A. Potra:
On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems. SIAM J. Optim. 3(2): 413-422 (1993) - [j4]Florian A. Potra, Yinyu Ye:
A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems. SIAM J. Optim. 3(4): 843-860 (1993)
1980 – 1989
- 1989
- [j3]Götz Alefeld, Florian A. Potra:
A new class of interval methods with higher order of convergence. Computing 42(1): 69-80 (1989) - 1987
- [j2]Florian A. Potra:
On a monotone Newton-like method. Computing 39(3): 233-246 (1987) - 1986
- [j1]Florian A. Potra, Werner C. Rheinboldt:
On the monotone convergence of Newton's method. Computing 36(1-2): 81-90 (1986)
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:23 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:
