Pages that link to "Item:Q378283"
From MaRDI portal
The following pages link to A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283):
Displaying 36 items.
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
- Derivatives of eigenvalues and Jordan frames (Q317127) (← links)
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming (Q493049) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← 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 wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization (Q1646672) (← links)
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming (Q1677164) (← links)
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771) (← links)
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem (Q2086935) (← links)
- An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs (Q2173343) (← links)
- A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization (Q2176832) (← links)
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood (Q2221151) (← links)
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization (Q2228421) (← links)
- A corrector-predictor arc search interior-point algorithm for symmetric optimization (Q2313142) (← links)
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
- Two wide neighborhood interior-point methods for symmetric cone optimization (Q2401022) (← links)
- A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787) (← links)
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833) (← links)
- A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
- A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i><sup>−1</sup>) iteration complexity (Q3174878) (← links)
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
- A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
- A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i><sub>*</sub>(κ)-HLCP (Q4646542) (← links)
- An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones (Q4959371) (← links)
- A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood (Q4988920) (← links)
- Infeasible path-following interior point algorithm for Cartesian <i>P</i><sub>*</sub>(κ) nonlinear complementarity problems over symmetric cones (Q5026485) (← links)
- A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming (Q5058407) (← links)
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function (Q6158944) (← links)