| Optimierung F Jarre, J Stoer Springer, 2004 | 319 | 2004 |
| Solving the sum-of-ratios problem by an interior-point method RW Freund, F Jarre Journal of Global Optimization 19 (1), 83-102, 2001 | 250 | 2001 |
| An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices F Jarre SIAM Journal on Control and Optimization 31 (5), 1360-1377, 1993 | 151 | 1993 |
| An extension of the positive real lemma to descriptor systems RW Freund, F Jarre Optimization methods and software 19 (1), 69-87, 2004 | 125 | 2004 |
| Optimal truss design by interior-point methods F Jarre, M Kocvara, J Zowe SIAM Journal on Optimization 8 (4), 1084-1107, 1998 | 118 | 1998 |
| Optimal design of trusses under a nonconvex global buckling constraint A Ben-Tal, F Jarre, M Kočvara, A Nemirovski, J Zowe Optimization and Engineering 1, 189-213, 2000 | 114 | 2000 |
| On the convergence of the method of analytic centers when applied to convex quadratic programs F Jarre Mathematical Programming 49 (1), 341-358, 1990 | 98 | 1990 |
| Interior-point methods for convex programming F Jarre Applied Mathematics and Optimization 26 (3), 287-311, 1992 | 97 | 1992 |
| Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling RW Freund, F Jarre, CH Vogelbusch Mathematical Programming 109, 581-611, 2007 | 95 | 2007 |
| A QMR-based interior-point algorithm for solving linear programs RW Freund, F Jarre Mathematical Programming 76, 183-210, 1997 | 88 | 1997 |
| An interior method for nonconvex semidefinite programs F Jarre Optimization and Engineering 1, 347-372, 2000 | 86 | 2000 |
| Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. S Mizuno, F Jarre Mathematical Programming 84 (1), 1999 | 82 | 1999 |
| CycleFreeFlux: efficient removal of thermodynamically infeasible loops from flux distributions AA Desouki, F Jarre, G Gelius-Dietrich, MJ Lercher Bioinformatics 31 (13), 2159-2165, 2015 | 72 | 2015 |
| The method of analytic centers for smooth convex programs F Jarre Grottenthaler, 1989 | 70 | 1989 |
| Convergence of a class of inexact interior-point algorithms for linear programs RW Freund, F Jarre, S Mizuno Mathematics of Operations Research 24 (1), 50-71, 1999 | 65 | 1999 |
| A sufficient condition for self-concordance, with application to some classes of structured convex programming problems D den Hertog, F Jarre, C Roos, T Terlaky Mathematical Programming 69, 75-88, 1995 | 57 | 1995 |
| An implementation of the method of analytic centers F Jarre, G Sonnevend, J Stoer Analysis and Optimization of Systems, 295-308, 1988 | 49 | 1988 |
| An interior-point method for fractional programs with convex constraints RW Freund, F Jarre Mathematical Programming 67, 407-440, 1994 | 47 | 1994 |
| A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems S Mizuno, F Jarre, J Stoer Applied Mathematics and Optimization 33, 315-341, 1996 | 45 | 1996 |
| Interior-point methods via self-concordance or relative Lipschitz condition F Jarre Optimization Methods and Software 5 (1), 75-104, 1995 | 45 | 1995 |
Roland FreundProfessor of Mathematics, University of California, Davismath.ucdavis.edu의 이메일 확인됨
