Pages that link to "Item:Q4943613"
From MaRDI portal
The following pages link to On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming (Q4943613):
Displaying 15 items.
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization (Q378264) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems (Q630020) (← links)
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems (Q868472) (← links)
- Analyticity of weighted central paths and error bounds for semidefinite programming (Q948959) (← links)
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
- Interior-point methods (Q1593831) (← links)
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
- Generating and measuring instances of hard semidefinite programs (Q1960189) (← links)
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming (Q2273110) (← links)
- Logarithmic barrier method via minorant function for linear semidefinite programming (Q2693233) (← links)
- A relaxed logarithmic barrier method for semidefinite programming (Q5501874) (← links)
