A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
From MaRDI portal
Recommendations
- A one-phase algorithm for semi-infinite linear programming
- scientific article; zbMATH DE number 776087
- An interior-point method for semi-infinite programming problems
- Interior-point algorithms for semi-infinite programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
Cites work
- A primal-dual infeasible-interior-point algorithm for linear programming
- An inexact approach to solving linear semi-infinite programming problems
- Ein Konstruktionsverfahren bei allgemeiner linearer Approximation
- scientific article; zbMATH DE number 439946 (Why is no real title available?)
- scientific article; zbMATH DE number 3870083 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 3817429 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 776087 (Why is no real title available?)
- Infinite programming. Proceedings of an International Symposium on Infinite Dimensional Linear Programming, Churchill College, Cambridge, United Kingdom, September 7-10, 1984
- Numerical treatment of a class of semi‐infinite programming problems
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- The continuous complementarity problem
Cited in
(19)- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- New descent rules for solving the linear semi-infinite programming problem
- Interior-point algorithms for semi-infinite programming
- An infeasible interior-point algorithm for solving primal and dual geometric programs
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- scientific article; zbMATH DE number 3945873 (Why is no real title available?)
- scientific article; zbMATH DE number 3978818 (Why is no real title available?)
- On Linear Semi-Infinite Programming Problems: An Algorithm
- scientific article; zbMATH DE number 1782596 (Why is no real title available?)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- scientific article; zbMATH DE number 776087 (Why is no real title available?)
- Primal-dual partitions in linear semi-infinite programming with bounded coefficients
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- An inexact primal-dual algorithm for semi-infinite programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- A one-phase algorithm for semi-infinite linear programming
- A parallel algorithm for semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894948)
