The following pages link to Behrouz Kheirfam (Q261843):
Displaying 50 items.
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function (Q380342) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem (Q464544) (← links)
- A weighted-path-following method for symmetric cone linear complementarity problems (Q478931) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- An infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
- An infeasible interior-point method for monotone LCP based on a kernel function with full-Newton step (Q528938) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- (Q721593) (redirect page) (← links)
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
- Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path (Q722338) (← links)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
- Multi-parametric sensitivity analysis of the constraint matrix in piecewise linear fractional programming (Q974722) (← links)
- Multi-parametric sensitivity analysis in piecewise linear fractional programming (Q1008806) (← links)
- Comments on ``Generalized support set invariancy sensitivity analysis in linear optimization'' (Q1018912) (← links)
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function (Q1733331) (← links)
- Strict sensitivity analysis in fuzzy quadratic programming (Q1759723) (← links)
- The dual simplex method and sensitivity analysis for fuzzy linear programming with symmetric trapezoidal numbers (Q1794335) (← links)
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
- A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function (Q2053067) (← links)
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization (Q2142525) (← links)
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps (Q2192573) (← links)
- A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization (Q2228364) (← links)
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem (Q2249832) (← links)
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization (Q2260663) (← links)
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function (Q2322537) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds (Q2361520) (← links)
- An improved infeasible interior-point method for symmetric cone linear complementarity problem (Q2412177) (← links)
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem (Q2448176) (← links)
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
- (Q2792990) (← links)
- (Q2793004) (← links)
- A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization (Q2795090) (← links)
- An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem (Q2808306) (← links)
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function (Q2810097) (← links)
- An improved and modified infeasible interior-point method for symmetric optimization (Q2818303) (← links)
- (Q2865887) (← links)
- A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY (Q2895762) (← links)
- (Q2914508) (← links)
- A corrector–predictor path-following algorithm for semidefinite optimization (Q2920903) (← links)
