The following pages link to (Q4791754):
Displayed 29 items.
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
- Hardness-packing density scaling relations for cohesive-frictional porous materials (Q957449) (← links)
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems (Q979273) (← links)
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization (Q995953) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization (Q1014009) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms (Q2266861) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function (Q2477797) (← links)
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems (Q2483352) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
- The complexity of self-regular proximity based infeasible IPMs (Q2506182) (← links)
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function (Q2583508) (← links)
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming (Q3368128) (← links)
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods (Q3505061) (← links)
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function (Q3539807) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- Kernel-function Based Algorithms for Semidefinite Optimization (Q3632808) (← links)
- A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION (Q3636502) (← links)
- A polynomial-time algorithm for linear optimization based on a new simple kernel function (Q4650623) (← links)
- An interior point method for linear programming based on a class of Kernel functions (Q4654260) (← links)
- A new primal-dual interior-point algorithm for convex quadratic optimization (Q5320227) (← links)
- Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization (Q5320239) (← links)