Finding graph embeddings by incremental low-rank semidefinite programming

DOI10.1080/10556788.2015.1014553MaRDI QIDQ3458829zbMATH OpenOpenAlexFDO

Authors Seppo Pulkkinen

Publication date 28 December 2015

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2015.1014553

zbMATH Keywords

dimensionality reductionsemidefinite programmingaugmented Lagrangian methodsinterior-point methodsgraph embeddingmaximum variance unfoldingconcave quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Applications of graph theory (05C90) Interior-point methods (90C51) Semidefinite programming (90C22) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 2088028
• Embedding methods for semidefinite programming
• Scalable semidefinite programming
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph

Cites work

• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• ARPACK Users' Guide
• Adaptive Barrier Update Strategies for Nonlinear Interior Methods
• Algorithm 875
• An Interior-Point Method for Semidefinite Programming
• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
• Automated empirical optimizations of software and the ATLAS project
• CSDP, A C library for semidefinite programming
• Embedded in the Shadow of the Separator
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Improving ultimate convergence of an augmented Lagrangian method
• LAPACK Users' Guide
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
• Local minima and convergence in low-rank semidefinite programming
• Low-rank optimization on the cone of positive semidefinite matrices
• Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems
• Nonlinear Programming
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Second-order negative-curvature methods for box-constrained and general constrained optimization
• Semidefinite Programming
• Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
• The Fastest Mixing Markov Process on a Graph and a Connection to a Maximum Variance Unfolding Problem
• The Lanczos and Conjugate Gradient Algorithms
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(1)

• Improved linear embeddings via Lagrange duality

This page was built for publication: Finding graph embeddings by incremental low-rank semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458829)