swMATH5119MaRDI QIDQ17259FDOQ17259
Author name not available (Why is that?)
Official website: http://www.penopt.com/pensdp.html
Cited In (32)
- Lagrangian transformation and interior ellipsoid methods in convex optimization
- A globally convergent filter-type trust region method for semidefinite programming
- A Newton-CG augmented Lagrangian method for semidefinite programming
- Computational enhancements in low-rank semidefinite programming
- On barrier and modified barrier multigrid methods for three-dimensional topology optimization
- A boundary point method to solve semidefinite programs
- New results on the application of the passification method. A survey
- Matrix-free convex optimization modeling
- SOC-monotone and SOC-convex functions vs. matrix-monotone and matrix-convex functions
- Solving large-scale semidefinite programs in parallel
- An Augmented Primal-Dual Method for Linear Conic Programs
- Free material optimization for stress constraints
- Optimality conditions and global convergence for nonlinear semidefinite programming
- Primal-dual interior point multigrid method for topology optimization
- Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- The Legendre transformation in modern optimization
- DSDP5
- COL
- QSDP
- SDPLR
- lambda
- Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
- SBmethod
- Optspace
- A proximal augmented method for semidefinite programming problems
- ADMM_QAP
- A sequential convex semidefinite programming algorithm with an application to multiple-load free material optimization
- A trust region method for solving semidefinite programs
- A primal-dual interior point trust-region method for nonlinear semidefinite programming
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- Solving \(k\)-cluster problems to optimality with semidefinite programming
This page was built for software: PENSDP
