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

DOI10.1007/BF02591745zbMath0588.90074OpenAlexW1978931134MaRDI QIDQ3716828

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

optimality conditionsnonconvex programmingtriangulationsgeneralized singular value decompositionaverage directional densityoptimal linear transformations

Mathematics Subject Classification ID

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

Related Items (1)

On parametric nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• $J'$: A New Triangulation of $R^n $
• Equivalence of Surface Density and Average Directional Density
• Permutation congruent transformations of the freudenthal triangulation with minimum surface density
• Least Change Secant Updates for Quasi-Newton Methods
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• An improvement of fixed point algorithms by using a good triangulation
• The octahedral algorithm, a new simplicial fixed point algorithm
• Generalizing the Singular Value Decomposition
• On triangulations for computing fixed points
• Improving the convergence of fixed-point algorithms

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