A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
Self-Scaled Barriers and Interior-Point Methods for Convex Programming
An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
A note on an inequality involving Jordan product in Euclidean Jordan algebras
Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
Linear systems in Jordan algebras and primal-dual interior-point algorithms
Euclidean Jordan algebras and interior-point algorithms
Extension of primal-dual interior point algorithms to symmetric cones
Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
Neighborhood-following algorithms for linear programming
Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
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
A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
Barrier Functions in Interior Point Methods
Primal-Dual Interior-Point Methods for Self-Scaled Cones
Interior-point methods based on kernel functions for symmetric optimization
An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
对称锥规划的邻域跟踪算法

Cited In (5)

An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression
A modified and simplified full Nesterov-Todd step $\mathcal {O}(N)$ infeasible interior-point method for second-order cone optimization
A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
Two wide neighborhood interior-point methods for symmetric cone optimization
A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization

Recommendations

Title not available (Why is that?) 👍 👎
Title not available (Why is that?) 👍 👎
A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming 👍 👎
A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming 👍 👎
A new infeasible-interior-point algorithm for linear programming over symmetric cones 👍 👎
A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization 👍 👎
An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood 👍 👎
Two wide neighborhood interior-point methods for symmetric cone optimization 👍 👎
A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming 👍 👎
An improved infeasible interior-point method for symmetric cone linear complementarity problem 👍 👎

This page was built for publication: A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630833)