The following pages link to Florian A. Potra (Q229630):
Displaying 50 items.
- Sufficient weighted complementarity problems (Q288407) (← links)
- Corrector-predictor methods for sufficient linear complementarity problems (Q538303) (← links)
- (Q848724) (redirect page) (← links)
- Multihazard design: Structural optimization approach (Q848726) (← links)
- Minimal condition number for positive definite Hankel matrices using semidefinite programming (Q989049) (← links)
- Stochastic second-order cone programming in mobile ad hoc networks (Q1039371) (← links)
- On the monotone convergence of Newton's method (Q1062426) (← links)
- On a monotone Newton-like method (Q1092613) (← links)
- On Q-order and R-order of convergence (Q1114311) (← links)
- The discrete Galerkin method for nonlinear integral equations (Q1115113) (← links)
- A new class of interval methods with higher order of convergence (Q1122314) (← links)
- Sharp error bounds for Newton's process (Q1139919) (← links)
- An error analysis for the secant method (Q1154788) (← links)
- A generalization of regula falsi (Q1161253) (← links)
- Some efficient methods for enclosing simple zeros of nonlinear equations (Q1196877) (← links)
- ODAE methods for the numerical solution of Euler-Lagrange equations (Q1201031) (← links)
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999) (← links)
- A path following method for LCP with superlinearly convergent iteration sequence (Q1265875) (← links)
- Secant methods for semismooth equations (Q1266319) (← links)
- Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164) (← links)
- Modifications of the interval-Newton-method with improved asymptotic efficiency (Q1279689) (← links)
- Interior-point algorithm for quadratically constrained entropy minimization problems (Q1321322) (← links)
- Efficient hybrid algorithms for finding zeros of convex functions (Q1333238) (← links)
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points (Q1361112) (← links)
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP (Q1365467) (← links)
- Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems (Q1384172) (← links)
- On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence (Q1582351) (← links)
- Interior-point methods (Q1593831) (← links)
- Numerical validation of solutions of complementarity problems: the nonlinear case (Q1615000) (← links)
- Equilibria and weighted complementarity problems (Q1627496) (← links)
- A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
- The Kantorovich theorem and interior point methods (Q1769068) (← links)
- A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches (Q1789611) (← links)
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points (Q1804652) (← links)
- Numerical validation of solutions of linear complementarity problems (Q1805871) (← links)
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path (Q1848380) (← links)
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity (Q1881563) (← links)
- Efficent line search algorithm for unconstrained optimization (Q1896577) (← links)
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence (Q1915906) (← links)
- Interior-point methods for nonlinear complementarity problems (Q1918290) (← links)
- A characterization of the behavior of the Anderson acceleration on linear problems (Q1931717) (← links)
- Time-stepping for three-dimensional rigid body dynamics (Q1972928) (← links)
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation (Q2023682) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← links)
- Optimal kinematics of a looped filament (Q2435020) (← links)
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path (Q2467158) (← links)
- Integral operators and delay differential equations (Q2476450) (← links)
- On the probabilistic complexity of finding an approximate solution for linear programming (Q2483208) (← links)
- Efficient implementation of fully implicit methods for atmospheric chemical kinetics (Q2564463) (← links)
- Robust and distributionally robust optimization models for linear support vector machine (Q2676336) (← links)
