The convergent generalized central paths for linearly constrained convex programming
From MaRDI portal
Recommendations
- Analysis of some interior point continuous trajectories for convex programming
- Interior Point Trajectories in Semidefinite Programming
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- Welldefinedness and limiting behavior of the central path
- On well definedness of the central path
Cites work
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A study of the dual affine scaling continuous trajectories for linear programming
- An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- Dynamical system characterization of the central path and its variants -- a revisit
- Dynamics of games and genes: Discrete versus continuous time
- Examples of ill-behaved central paths in convex optimization
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 1989717 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 967713 (Why is no real title available?)
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- Limiting behavior of weighted central paths in linear programming
- Matrix Analysis
- On the Convergence of the Central Path in Semidefinite Optimization
- On the existence and convergence of the central path for convex programming and some duality results
- On well definedness of the central path
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
Cited in
(6)- On the existence and convergence of the central path for convex programming and some duality results
- Examples of ill-behaved central paths in convex optimization
- An interior point parameterized central path following algorithm for linearly constrained convex programming
- On the Convergence of the Central Path in Semidefinite Optimization
- Analysis of some interior point continuous trajectories for convex programming
- Convergence analysis of four interior point continuous trajectories for convex semidefinite programming
This page was built for publication: The convergent generalized central paths for linearly constrained convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4641644)
