A generalized interior-point barrier function approach for smooth convex programming with linear constraints
From MaRDI portal
Publication:4264497
Recommendations
Cites work
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A modification of Karmarkar's linear programming algorithm
- A polynomial method of approximate centers for linear programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- Interior-point methods for convex programming
- On some efficient interior point methods for nonlinear convex programming
- On the generalized path-following methods for linear programming
Cited in
(8)- A convex analysis view of the barrier problem
- An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming
- A barrier method in convex vector optimization with generalized inequality constraints
- An adaptive barrier method for convex programming
- Linearly constrained convex programming as unconstrained differentiable concave programming
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- Solving continuous min-max problems by an iterative entropic regularization method.
This page was built for publication: A generalized interior-point barrier function approach for smooth convex programming with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264497)
