On the existence of convex decompositions of partially separable functions
From MaRDI portal
Publication:5186653
DOI10.1007/BF02612711zbMath0561.65045WikidataQ57389746 ScholiaQ57389746MaRDI QIDQ5186653
Andreas Griewank, Phillipe L. Toint
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
optimizationpositive definite matricesconvexificationsparsitypartial separabilitychordalconvex decompositionperfect eliminationfinite sum of element functionspartitioned variable metric methods
Related Items
Decomposition Methods for Sparse Matrix Nearness Problems, Sparse sums of squares on finite abelian groups and improved semidefinite lifts, On representing the positive semidefinite cone using the second-order cone, Linear optimization over homogeneous matrix cones, Chordal sparsity for SDP-based neural network verification, Sparse quasi-Newton updates with positive definite matrix completion, The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients, Decomposition of arrow type positive semidefinite matrices with application to topology optimization, Unconstrained duals to partially separable constrained programs, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, Recognizing underlying sparsity in optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Partitioned variable metric updates for large structured optimization problems
- Local convergence analysis for partitioned quasi-Newton updates
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Additively decomposed quasiconvex functions
