A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
From MaRDI portal
Publication:3640925
DOI10.1007/S11741-008-0602-3zbMATH Open1183.90331OpenAlexW2055971697MaRDI QIDQ3640925FDOQ3640925
Authors: Min Zhang, Yanqin Bai, Guoqiang Wang 
Publication date: 11 November 2009
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-008-0602-3
Recommendations
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
- A predictor-corrector algorithm for linearly constrained convex optimization
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- A primal-infeasible interior point algorithm for linearly constrained convex programming
- Interior path following primal-dual algorithms. I: Linear programming
polynomial complexitylinearly constrained convex optimizationinterior-point algorithmsmall-update method
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- On a homogeneous algorithm for the monotone complementarity problem
- Title not available (Why is that?)
- New interior point algorithms in linear programming
- A polynomial predictor-corrector interior-point algorithm for a class convex programming
- Title not available (Why is that?)
- Karmarkar's linear programming algorithm and Newton's method
- A new primal-dual interior-point algorithm for convex quadratic optimization
- A globally convergent primal-dual interior point algorithm for convex programming
- On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs
Cited In (11)
- Title not available (Why is that?)
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- New method for determining search directions for interior-point algorithms in linear optimization
- Title not available (Why is that?)
- Numerical comparisons of path-following strategies for a primal-dual interior-point method for nonlinear programming
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A predictor-corrector algorithm for linearly constrained convex optimization
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
This page was built for publication: A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3640925)
