Potential reduction method for harmonically convex programming
From MaRDI portal
(Redirected from Publication:1893464)
Recommendations
- A new potential reduction algorithm for smooth convex programming
- A potential reduction algorithm for linearly constrained convex programming
- On harmonic convexity (concavity) and application to non-linear programming problems.
- Some properties of generalized strongly harmonic convex functions
- scientific article; zbMATH DE number 3850830
Cites work
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- A multiplicative barrier function method for linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A proof of the polynomiality of the Iri-Imai method
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- Conical projection algorithms for linear programming
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- scientific article; zbMATH DE number 4102820 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 4121759 (Why is no real title available?)
- scientific article; zbMATH DE number 3253619 (Why is no real title available?)
- Interior point algorithms for linear programming with inequality constraints
- Interior-point methods for convex programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
This page was built for publication: Potential reduction method for harmonically convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893464)
