‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems

DOI10.1007/BF02591745MaRDI QIDQ3716828zbMATH OpenOpenAlexFDO

Authors Michael J. Todd

Publication date 1985

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02591745

zbMATH Keywords

optimal linear transformationsaverage directional densitygeneralized singular value decompositionnonconvex programmingoptimality conditionstriangulations

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Triangulating manifolds (57Q15) Numerical computation of solutions to systems of equations (65H10) Nonlinear programming (90C30)

Recommendations

• Permutation congruent transformations of the freudenthal triangulation with minimum surface density
• J': A New Triangulation of R^n
• scientific article; zbMATH DE number 3908501
• The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
• scientific article; zbMATH DE number 2066953

Cites work

• J': A New Triangulation of R^n
• An improvement of fixed point algorithms by using a good triangulation
• Equivalence of Surface Density and Average Directional Density
• Generalizing the Singular Value Decomposition
• scientific article; zbMATH DE number 3136785 (Why is no real title available?)
• scientific article; zbMATH DE number 3728016 (Why is no real title available?)
• scientific article; zbMATH DE number 3535189 (Why is no real title available?)
• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Improving the convergence of fixed-point algorithms
• Least Change Secant Updates for Quasi-Newton Methods
• On triangulations for computing fixed points
• Permutation congruent transformations of the freudenthal triangulation with minimum surface density
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• The octahedral algorithm, a new simplicial fixed point algorithm

Cited in

(6)

• On parametric nonlinear programming
• scientific article; zbMATH DE number 3908501 (Why is no real title available?)
• Permutation congruent transformations of the freudenthal triangulation with minimum surface density
• Transformation into optimal parallelism in Euclidean spaces (or: How to explain the shape of the electron-density distribution inside a crystal)
• Exact and approximation algorithms for computing optimal fat decompositions
• Discrete geometry and optimization

This page was built for publication: ‘Fat’ triangulations, or solving certain nonconvex matrix optimization problems

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