Florian A. Potra

According to our database1, Florian A. Potra authored at least 56 papers between 1986 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Robust and Distributionally Robust Optimization Models for Linear Support Vector Machine.
Comput. Oper. Res., 2022

2020
A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems.
J. Optim. Theory Appl., 2020

Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton's equation.
Comput. Optim. Appl., 2020

2019
Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP.
Optim. Methods Softw., 2019

A homogeneous model for monotone mixed horizontal linear complementarity problems.
Comput. Optim. Appl., 2019

2017
A Superquadratic Variant of Newton's Method.
SIAM J. Numer. Anal., 2017

A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches.
Comput. Manag. Sci., 2017

2016
Sufficient weighted complementarity problems.
Comput. Optim. Appl., 2016

2014
Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity.
SIAM J. Optim., 2014

2013
Optimal Kinematics of a Looped Filament.
J. Optim. Theory Appl., 2013

2012
Weighted Complementarity Problems - A New Paradigm for Computing Equilibria.
SIAM J. Optim., 2012

2011
Corrector-predictor methods for sufficient linear complementarity problems.
Comput. Optim. Appl., 2011

2009
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP.
SIAM J. Optim., 2009

A computational study of the use of an optimization-based method for simulating large multibody systems.
Optim. Methods Softw., 2009

2008
Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems.
SIAM J. Optim., 2008

Convergence of a Class of Semi-Implicit Time-Stepping Schemes for Nonsmooth Rigid Multibody Dynamics.
SIAM J. Optim., 2008

Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path.
Math. Program., 2008

On the probabilistic complexity of finding an approximate solution for linear programming.
J. Complex., 2008

2007
Protein image alignment via tensor product cubic splines.
Optim. Methods Softw., 2007

A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(Ö<i>nL</i>)-iteration complexity.
Math. Program., 2007

2006
Corrector-Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path.
SIAM J. Optim., 2006

Erratum: predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path.
Optim. Methods Softw., 2006

Protein Image Alignment via Piecewise Affine Transformations.
J. Comput. Biol., 2006

Aligning Families of Two-Dimensional Gels by a Combined Multiresolution Forward-Inverse Transformation Approach.
J. Comput. Biol., 2006

2005
Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path.
Optim. Methods Softw., 2005

The Kantorovich Theorem and interior point methods.
Math. Program., 2005

2004
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with -iteration complexity.
Math. Program., 2004

2002
Numerical validation of solutions of complementarity The nonlinear case.
Numerische Mathematik, 2002

The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path.
Eur. J. Oper. Res., 2002

2001
Q-superlinear convergence of the iterates in primal-dual interior-point methods.
Math. Program., 2001

1999
On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming.
SIAM J. Optim., 1999

Nonsymmetric Search Directions for Semidefinite Programming.
SIAM J. Optim., 1999

Numerical validation of solutions of linear complementarity problems.
Numerische Mathematik, 1999

Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming.
Math. Oper. Res., 1999

1998
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming.
SIAM J. Optim., 1998

On Effectively Computing the Analytic Center of the Solution Set by Primal-Dual Interior-Point Methods.
SIAM J. Optim., 1998

Secant methods for semismooth equations.
Numerische Mathematik, 1998

A path following method for LCP withsuperlinearly convergent iteration sequence.
Ann. Oper. Res., 1998

1997
The role of linear semi-infinite programming in signal-adapted QMF bank design.
IEEE Trans. Signal Process., 1997

Improved Quasi-Steady-State-Approximation Methods for Atmospheric Chemistry Integration.
SIAM J. Sci. Comput., 1997

A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity.
SIAM J. Optim., 1997

A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP.
SIAM J. Optim., 1997

On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems.
Math. Oper. Res., 1997

1996
An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming.
SIAM J. Optim., 1996

Predictor-corrector algorithm for solving P<sub>*</sub>(k)-matrix LCP from arbitrary positive starting points.
Math. Program., 1996

An<i>O(nL)</i> infeasible-interior-point algorithm for LCP with quadratic convergence.
Ann. Oper. Res., 1996

High-Order Stiff ODE Solvers via Automatic Differentiation and Rational Prediction.
Proceedings of the Numerical Analysis and Its Applications, First International Workshop, 1996

Design of signal-adapted FIR paraunitary filter banks.
Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

1995
Algorithm 748: Enclosing Zeros of Continuous Functions.
ACM Trans. Math. Softw., 1995

1994
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points.
Math. Program., 1994

Efficient Hybrid Algorithms for Finding Zeros of Convex Functions.
J. Complex., 1994

1993
On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems.
SIAM J. Optim., 1993

A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems.
SIAM J. Optim., 1993

1989
A new class of interval methods with higher order of convergence.
Computing, 1989

1987
On a monotone Newton-like method.
Computing, 1987

1986
On the monotone convergence of Newton's method.
Computing, 1986


  Loading...