Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
From MaRDI portal
Recommendations
- Logarithmic barrier function method for convex quadric programming problem
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- An efficient logarithmic barrier method without line search for convex quadratic programming
- A logarithm barrier method for linear programming
- A logarithmic barrier approach for linear programming
- Line Search Procedures for the Logarithmic Barrier Function
- One modification of the logarithmic barrier function method in linear and convex programming
- Logarithmic Barrier Method Via Minorant Function for Linear Programming
- A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems
- scientific article; zbMATH DE number 2206826
Cited in
(7)- A new line-search step based on the Weierstrass \(\wp\)-function for minimizing a class of logarithmic barrier functions
- Higher-order derivatives in linear and quadratic programming
- Logarithmic barrier function method for convex quadric programming problem
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- Line Search Procedures for the Logarithmic Barrier Function
- A Linesearch Procedure in Barrier Methods for Some Convex Programming Problems
- scientific article; zbMATH DE number 7473683 (Why is no real title available?)
This page was built for publication: Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834254)