An exterior point method for the convex programming problem
From MaRDI portal
Recommendations
- An exterior-point method for linear programming problems
- An exterior point polynomial-time algorithm for convex quadratic programming
- scientific article; zbMATH DE number 710572
- An exterior point simplex algorithm for (general) linear programming problems
- Exterior point algorithms for nearest points and convex quadratic programs
- Primal–dual exterior point method for convex optimization
- An exterior point linear programming method based on inclusive normal cones
- A Primal-Dual Exterior Point Method for Nonlinear Optimization
- Exterior point simplex-type algorithms for linear and network optimization problems
- Exterior point methods with adaptation of admissible set approximation for constrained optimization problems
Cites work
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- A nonlinear programming technique for the optimization of continuous processing systems
- Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes
Cited in
(8)- On using exterior penalty approaches for solving linear programming problems
- An exterior Newton method for strictly convex quadratic programming
- Primal–dual exterior point method for convex optimization
- An approximate method for solving the convex programming problem
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 3892945 (Why is no real title available?)
- An exterior-point method for linear programming problems
- scientific article; zbMATH DE number 710572 (Why is no real title available?)
This page was built for publication: An exterior point method for the convex programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321136)
