The following pages link to (Q4791754):
Displayed 50 items.
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function (Q255679) (← links)
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem (Q257756) (← links)
- An efficient fifth-order method for linear optimization (Q306315) (← links)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
- A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems (Q353550) (← links)
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← links)
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- A full-Newton step interior-point algorithm based on modified Newton direction (Q408387) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function (Q471570) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term (Q513522) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- Interior point algorithm for \(P_*\) nonlinear complementarity problems (Q544204) (← links)
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- New parameterized kernel functions for linear optimization (Q693134) (← links)
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term (Q695048) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems (Q725814) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function (Q742844) (← links)
- An adaptive infeasible interior-point algorithm for linear complementarity problems (Q743784) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← 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)
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem (Q890633) (← 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)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm (Q1689710) (← links)