Pages that link to "Item:Q1610312"
From MaRDI portal
The following pages link to Interior-point algorithms for semidefinite programming based on a nonlinear formulation (Q1610312):
Displaying 13 items.
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming (Q1411642) (← links)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization (Q1411644) (← links)
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs (Q1411645) (← links)
- Solving a class of semidefinite programs via nonlinear programming (Q1849262) (← links)
- Primal-dual Newton-type interior-point method for topology optimization (Q1862194) (← links)
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs (Q2505379) (← links)
- On the Turing model complexity of interior point methods for semidefinite programming (Q2821802) (← links)
- A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470655) (← links)
- A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470658) (← links)
- $LDL^T$ Direction Interior Point Method for Semidefinite Programming (Q4609469) (← links)
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma (Q4681655) (← links)
