scientific article; zbMATH DE number 822140
From MaRDI portal
Publication:4856274
zbMATH Open0835.90065MaRDI QIDQ4856274FDOQ4856274
Authors: Tiande Guo
Publication date: 14 December 1995
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1919460
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
- scientific article; zbMATH DE number 2070508
- scientific article; zbMATH DE number 1526551
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- An interior point-proximal method of multipliers for convex quadratic programming
- A polynomial predictor-corrector interior-point algorithm for a class convex programming
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming
- A New Practically Efficient Interior Point Method for Convex Quadratic Programming
- A corrector-predictor interior-point method with new search direction for linear optimization
Cited In (16)
- Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming
- A wide-neighborhood predictor-corrector algorithm for convex quadratic programming
- A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
- On Mehrotra-type predictor-corrector algorithms for convex quadratic programming
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
- Title not available (Why is that?)
- A corrector-predictor interior-point method with new search direction for linear optimization
- A polynomial predictor-corrector interior-point algorithm for a class convex programming
- Title not available (Why is that?)
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- An interior point algorithm for convex quadratic programming with strict equilibrium constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4856274)