Numerical decomposition of a convex function
From MaRDI portal
Publication:799479
DOI10.1007/BF00941315zbMath0548.90053OpenAlexW2063435908MaRDI QIDQ799479
Publication date: 1985
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00941315
orthogonal matrixcone of directions of constancynumerically stable algorithmorthogonal direct sum decomposition
Convex programming (90C25) Convexity of real functions of several variables, generalizations (26B25) Methods of successive quadratic programming type (90C55)
Related Items
Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Minimal representation of convex regions defined by analytic functions ⋮ On infeasibility of systems of convex analytic inequalities ⋮ Convex constrained programmes with unattained infima
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calculating the cone of directions of constancy
- Geometry of optimality conditions and constraint qualifications: The convex case
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- Analysis of Algorithms for Reflections in Bisectors
