Pages that link to "Item:Q5470240"

The following pages link to Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones (Q5470240):

Displaying 50 items.

• A note on an inequality involving Jordan product in Euclidean Jordan algebras (Q276321) (← links)
• A Lie product type formula in Euclidean Jordan algebras (Q301846) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← 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)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← 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)
• 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 infeasible full-NT step interior point algorithm for CQSCO (Q503355) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function (Q711514) (← links)
• A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← links)
• A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• Z-transformations on proper and symmetric cones (Q959969) (← links)
• A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones (Q1043012) (← links)
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function (Q1048238) (← 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)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← 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)
• 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)
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
• Lyapunov-type least-squares problems over symmetric cones (Q1758453) (← links)
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones (Q1937004) (← links)
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
• An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
• Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
• Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming (Q2257767) (← 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 infeasible full NT-step interior point method for circular optimization (Q2360232) (← links)
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path (Q2361136) (← links)
• A new infeasible-interior-point algorithm for linear programming over symmetric cones (Q2401787) (← links)
• An infeasible interior-point algorithm for stochastic second-order cone optimization (Q2420786) (← links)
• A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem (Q2448176) (← links)
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
• A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833) (← links)
• A new corrector-predictor interior-point method for symmetric cone optimization (Q2678433) (← links)