THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
From MaRDI portal
Publication:4548041
Recommendations
- On the central path for nonlinear semidefinite programming
- On the central paths and Cauchy trajectories in semidefinite programming
- On well definedness of the central path
- Welldefinedness and limiting behavior of the central path
- Analyticity of the central path at the boundary point in semidefinite programming
Cites work
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A unified approach to interior point algorithms for linear complementary problems
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- Convex Analysis
- Geometric categories and o-minimal structures
- Interior Point Trajectories in Semidefinite Programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
- On Eigenvalue Optimization
- On the central path for nonlinear semidefinite programming
- On the existence and convergence of the central path for convex programming and some duality results
- On the real exponential field with restricted analytic functions
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- The elementary theory of restricted analytic fields with exponentiation
- Welldefinedness and limiting behavior of the central path
Cited in
(20)- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- On a special class of regularized central paths for semidefinite programs
- Condition-measure bounds on the behavior of the central trajectory of a semidefinite program
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Interior proximal methods and central paths for convex second-order cone programming
- On the central paths and Cauchy trajectories in semidefinite programming
- Penalty and barrier methods for convex semidefinite programming
- Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
- On the central path of semidefinite optimization: degree and worst-case convergence rate
- On the central paths in symmetric cone programming
- Welldefinedness and limiting behavior of the central path
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- 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 some properties and an application of the logarithmic barrier method
- Improved effective Łojasiewicz inequality and applications
- Convergence analysis of four interior point continuous trajectories for convex semidefinite programming
- Limiting behavior of the central path in semidefinite optimization
- On the central path for nonlinear semidefinite programming
- Dynamical system characterization of the central path and its variants -- a revisit
This page was built for publication: THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4548041)
