The following pages link to (Q3415802):
Displaying 50 items.
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
- A polynomial interior-point algorithm for monotone linear complementarity problems (Q353166) (← links)
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem (Q376771) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← 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 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)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP (Q497434) (← links)
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization (Q894428) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization (Q1660297) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier (Q1709950) (← links)
- A generalized direction in interior point method for monotone linear complementarity problems (Q1733321) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization (Q2016468) (← links)
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem (Q2046555) (← links)
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function (Q2053077) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- A full-Newton step interior-point method for monotone weighted linear complementarity problems (Q2198532) (← 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 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)
- Simplified infeasible interior-point algorithm for linear optimization based on a simple function (Q2294231) (← links)
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function (Q2317415) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462) (← links)
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems (Q2376364) (← links)
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322) (← links)
- A new corrector-predictor interior-point method for symmetric cone optimization (Q2678433) (← links)
- The new full-Newton step interior-point algorithm for the Fisher market equilibrium problems based on a kernel function (Q2698611) (← links)
- An improved and modified infeasible interior-point method for symmetric optimization (Q2818303) (← links)
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization (Q3057532) (← links)
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function (Q3177630) (← links)
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925) (← links)
