A predictor-corrector algorithm for linearly constrained convex optimization
From MaRDI portal
Publication:2997579
Recommendations
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
- A new predictor-collector algorithm for linear programming
- A polynomial predictor-corrector interior-point algorithm for a class convex programming
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction
- Interior-point algorithm for linear optimization based on a new search direction
Cited in
(17)- A new corrector-predictor interior-point method for symmetric cone optimization
- A predictor-corrector algorithm for linear optimization based on a modified Newton direction
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- On the convergence of a predictor-corrector variant algorithm
- A predictor-corrector method for extended linear-quadratic programming
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
- Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization
- A corrector-predictor interior-point method with new search direction for linear optimization
- Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
- A new predictor-collector algorithm for linear programming
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- scientific article; zbMATH DE number 2070508 (Why is no real title available?)
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
This page was built for publication: A predictor-corrector 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 Q2997579)
