Pages that link to "Item:Q3083311"
From MaRDI portal
The following pages link to A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity (Q3083311):
Displayed 45 items.
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming (Q378283) (← 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)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier (Q1616941) (← links)
- A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization (Q1646672) (← links)
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
- On the extension of an arc-search interior-point algorithm for semidefinite optimization (Q1713225) (← links)
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771) (← links)
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood (Q1787924) (← links)
- A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← 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 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 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)
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607) (← 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)
- Self-Regular Interior-Point Methods for Semidefinite Optimization (Q2802533) (← links)
- A wide neighborhood predictor–corrector infeasible-interior-point method for Cartesian P∗(κ)-LCP over symmetric cones (Q2818293) (← links)
- A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
- New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (Q2867429) (← links)
- A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming (Q2921914) (← 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 Wide Neighborhood Primal-Dual Predictor-Corrector Interior-Point Method for Linear Programming (Q3188443) (← links)
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
- A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization (Q4633251) (← 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)
- An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood (Q5031228) (← links)
- An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization (Q5045166) (← links)
- A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization (Q5238196) (← links)
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions (Q5299914) (← links)
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming (Q6110633) (← links)
- A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization (Q6151644) (← links)
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function (Q6158944) (← links)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation (Q6166934) (← links)
