Analyticity of the central path at the boundary point in semidefinite programming
From MaRDI portal
(Redirected from Publication:1848384)
Recommendations
- Limiting behaviour and analyticity of weighted central paths in semidefinite programming
- Analyticity of weighted central paths and error bounds for semidefinite programming
- On sensitivity of central solutions in semidefinite programming
- Analytical properties of the central path at boundary point in linear programming
- Limiting behavior and analyticity of two special types of infeasible weighted central paths in semidefinite programming
Cites work
- \(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods
- A strongly polynomial rounding procedure yielding a maximally complementary solution for P_*() linear complementarity problems
- Analytical properties of the central path at boundary point in linear programming
- Condition-measure bounds on the behavior of the central trajectory of a semidefinite program
- Error Bounds for Linear Matrix Inequalities
- General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- scientific article; zbMATH DE number 4197741 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Interior Point Trajectories in Semidefinite Programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- 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 weighted central paths in linear programming
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- On sensitivity of central solutions in semidefinite programming
- On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems
- On two interior-point mappings for nonlinear semidefinite complementarity problems
- On weighted centers for semidefinite programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Semidefinite Programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists
- The analyticity of interior-point-paths at strictly complementary solutions of linear programs
- Two simple proofs for analyticity of the central path in linear programming.
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
Cited in
(25)- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- On the analyticity of underlying HKM paths for monotone semidefinite linear complementarity problems
- Analytical properties of the central path at boundary point in linear programming
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- Limiting behavior and analyticity of two special types of infeasible weighted central paths in semidefinite programming
- Limiting behaviour and analyticity of weighted central paths in semidefinite programming
- A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
- Interior Point Trajectories in Semidefinite Programming
- On the central path for nonlinear semidefinite programming
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
- \(LDL^T\) direction interior point method for semidefinite programming
- scientific article; zbMATH DE number 776096 (Why is no real title available?)
- Boosting the feasibility pump
- Limiting behavior of the central path in semidefinite optimization
- Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
- On the central path of semidefinite optimization: degree and worst-case convergence rate
- On the identification of the optimal partition for semidefinite optimization
- On sensitivity of central solutions in semidefinite programming
- Two simple proofs for analyticity of the central path in linear programming.
- On the complexity of analyticity in semi-definite optimization
- On the volumetric path
- Semi-algebraic structure and central paths in nonlinear optimization
- On a special class of regularized central paths for semidefinite programs
- Analyticity of weighted central paths and error bounds for semidefinite programming
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
This page was built for publication: Analyticity of the central path at the boundary point in semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848384)
