A new infeasible-interior-point algorithm for linear programming over symmetric cones
From MaRDI portal
Publication:2401787
DOI10.1007/S10255-017-0697-7zbMath1407.90347OpenAlexW2743157128MaRDI QIDQ2401787
Ping Han, Chang-He Liu, You-lin Shang
Publication date: 5 September 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-017-0697-7
Semidefinite programming (90C22) Convex programming (90C25) Linear programming (90C05) Interior-point methods (90C51)
Related Items (10)
Fast algorithms for sparse inverse covariance estimation ⋮ Applying deep learning method in TVP-VAR model under systematic financial risk monitoring and early warning ⋮ Image restoration by a mixed high-order total variation and \(l_1\) regularization model ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ Tikhonov regularized variable projection algorithms for separable nonlinear least squares problems ⋮ Fractional Meyer neural network procedures optimized by the genetic algorithm to solve the Bagley-Torvik model ⋮ Sequential quadratic programming method for nonlinear least squares estimation and its application ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ A new smoothing method for solving nonlinear complementarity problems ⋮ Designing of Morlet wavelet as a neural network for a novel prevention category in the HIV system
Cites Work
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- The \(Q\) method for symmetric cone programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- 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
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Neighborhood-following algorithms for linear programming
- 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
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 对称锥规划的邻域跟踪算法
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
This page was built for publication: A new infeasible-interior-point algorithm for linear programming over symmetric cones
