A new infeasible interior-point method based on Darvay's technique for symmetric optimization
From MaRDI portal
Publication:2449352
DOI10.1007/S10479-013-1474-5zbMATH Open1320.90082OpenAlexW1993024967MaRDI QIDQ2449352FDOQ2449352
Authors: Behrouz Kheirfam 
Publication date: 8 May 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1474-5
Recommendations
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- An improved and modified infeasible interior-point method for symmetric optimization
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 6285133
Euclidean Jordan algebrasinfeasible interior-point methodssmall-update methodsymmetric optimizationDarvay's~technique
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
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A Jordan-algebraic approach to potential-reduction algorithms
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- New interior point algorithms in linear programming
- Similarity and other spectral relations for symmetric cones
- On a commutative class of search directions for linear programming over symmetric cones
- Barrier Functions in Interior Point Methods
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
Cited In (19)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Title not available (Why is that?)
- Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- An infeasible full NT-step interior point method for circular optimization
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An extension for identifying search directions for interior-point methods in linear optimization
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- A new search direction for full-Newton step infeasible interior-point method in linear optimization
- A new search direction for full-Newton step interior-point method in \(P_*(\kappa)\)-HLCP
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- An infeasible full-NT step interior point algorithm for CQSCO
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
This page was built for publication: A new infeasible interior-point method based on Darvay's technique for symmetric optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449352)
