Pages that link to "Item:Q1849262"
From MaRDI portal
The following pages link to Solving a class of semidefinite programs via nonlinear programming (Q1849262):
Displaying 29 items.
- Finding a strict feasible solution of a linear semidefinite program (Q632881) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Large-scale semidefinite programming via a saddle point mirror-prox algorithm (Q868467) (← links)
- Efficient rank reduction of correlation matrices (Q875015) (← links)
- An inexact primal-dual path following algorithm for convex quadratic SDP (Q995786) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Solving highly nonlinear convex separable programs using successive approximation (Q1089265) (← 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)
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation (Q1610312) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
- An efficient approach to solve the large-scale semidefinite programming problems (Q1955162) (← links)
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs (Q2505379) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
- (Q3148083) (← links)
- (Q3315248) (← links)
- (Q4399581) (← 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)
- (Q4667219) (← links)
- Computational enhancements in low-rank semidefinite programming (Q5475287) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Global minimization of polynomial integral functionals (Q6573176) (← links)
