• # PENNON

• Referenced in 108 articles [sw04336]
• Pennon: A code for convex nonlinear and semidefinite programming. We introduce a computer program PENNON ... solution of problems of convex nonlinear and semidefinite programming (NLP-SDP). The algorithm used...
• # SDPLR

• Referenced in 146 articles [sw04745]
• Monteiro for solving general semidefinite programs (SDPs) using a nonlinear, first-order algorithm that ... also available for solving specially structured semidefinite programs (SDPs) such as the MaxCut ... technical report ”A Nonlinear Programming Algorithm for Semidefinite Programs via Low-rank Factorization” written...
• # COMPleib

• Referenced in 59 articles [sw06359]
• algorithms for linear semidefinite programs (SDPs), nonlinear semidefinite programs (NSDPs), minimizing spectral functions, Lyapunov/Riccati equations...
• # SNOPT

• Referenced in 543 articles [sw02300]
• programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear ... problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available ... particular implementation that makes use of a semidefinite QP solver. It is based...
• # JuMP

• Referenced in 123 articles [sw16108]
• linear, mixed-integer, quadratic, conic-quadratic, semidefinite, and nonlinear) in a high-level, algebraic syntax ... advantage of advanced features of the Julia programming language to offer unique functionality while achieving...
• # Pajarito

• Referenced in 4 articles [sw33900]
• Pajarito is a mixed-integer convex programming (MICP) solver package written in Julia. MICP problems ... rotated second-order, (primal) exponential, and positive semidefinite cones. MISOCP and MISDP are two established ... algorithms that use a derivative-based nonlinear programming (NLP) solver (e.g. Ipopt) instead...
• # SpeeDP

• Referenced in 4 articles [sw07003]
• instances We consider low-rank semidefinite programming (LRSDP) relaxations of unconstrained ${-1,1}$ quadratic problems ... formulated as the non-convex nonlinear programming problem of minimizing a quadratic function subject...
• # POCP

• Referenced in 1 article [sw05185]
• YALMIP. It is aimed at approximately solving nonlinear optimal control problems for which ... turn converted by GloptiPoly 3 as semidefinite programming problems...
• # tensegrity

• Referenced in 1 article [sw41265]
• describe the space of solutions will require (nonlinear) polynomials. In our examples, minors ... Tools from algebraic geometry, commutative algebra, semidefinite programming, and numerical algebraic geometry will be used...