PENSDP

swMATH5119MaRDI QIDQ17259FDOQ17259

Author name not available (Why is that?)

Described by source

• On the solution of large-scale SDP problems by the modified barrier method using iterative solvers

Cited In (24)

• Lagrangian transformation and interior ellipsoid methods in convex optimization
• A globally convergent filter-type trust region method for semidefinite programming
• Computational enhancements in low-rank semidefinite programming
• A boundary point method to solve semidefinite programs
• New results on the application of the passification method. A survey
• A Sequential Convex Semidefinite Programming Algorithm with an Application to Multiple-Load Free Material Optimization
• 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
• A Newton-CG Augmented Lagrangian Method for 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
• Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming
• A proximal augmented method for semidefinite programming problems
• Matrix-Free Convex Optimization Modeling
• 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
• The Legendre Transformation in Modern Optimization
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs
• On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization
• Solving \(k\)-cluster problems to optimality with semidefinite programming

This page was built for software: PENSDP