A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
From MaRDI portal
Publication:2016468
DOI10.1007/S10852-013-9227-7zbMATH Open1291.90127OpenAlexW2009334985MaRDI QIDQ2016468FDOQ2016468
Publication date: 20 June 2014
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-013-9227-7
Recommendations
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A modified full-Newton step infeasible interior-point algorithm for linear optimization
- A full-Newton step infeasible interior-point method based on a new search direction
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- Interior-point algorithm for linear optimization based on a new search direction
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- 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
- Feasibility issues in a primal-dual interior-point method for linear programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Title not available (Why is that?)
- New interior point algorithms in linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A new primal-dual path-following method for convex quadratic programming
- A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
Cited In (10)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Title not available (Why is that?)
- A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP
- 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
- A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization
- AN ADAPTIVE PRIMAL-DUAL FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- An infeasible interior-point algorithm with full-Newton step for linear optimization
This page was built for publication: A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016468)
