The following pages link to (Q4464638):
Displaying 15 items.
- PENNON (Q16515) (← links)
- Primal-dual active-set methods for large-scale optimization (Q493264) (← links)
- An adaptive augmented Lagrangian method for large-scale constrained optimization (Q494324) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Conforming approximation of convex functions with the finite element method (Q1679216) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Improved local convergence results for augmented Lagrangian methods in \(C^2\)-cone reducible constrained optimization (Q2316626) (← links)
- An approximation technique for robust nonlinear optimization (Q2492690) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- Elementary Optimality Conditions for Nonlinear SDPs (Q2802534) (← links)
- A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results (Q2949516) (← links)
- PENNON: A code for convex nonlinear and semidefinite programming (Q4457888) (← links)
- Penalty/Barrier multiplier algorthm for semidefinit programming<sup>∗</sup> (Q4514285) (← links)
- A primal-dual interior point trust-region method for nonlinear semidefinite programming (Q4999340) (← links)
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming (Q5058410) (← links)
