Calculating the cone of directions of constancy

DOI10.1007/BF00932906zbMATH Open0362.90132OpenAlexW2084163039MaRDI QIDQ1240157FDOQ1240157

Authors: Henry Wolkowicz 

Publication date: 1978

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical programming (90C99)

Cites Work

• Title not available (Why is that?)
• Characterization of optimality in convex programming without a constraint qualification
• On A characterization of optimality in convex programming

Cited In (7)

• Preprocessing and regularization for degenerate semidefinite programs
• Characterizing an optimal input in perturbed convex programming
• Regularizing the abstract convex program
• Method of reduction in convex programming
• Numerical decomposition of a convex function
• Geometry of optimality conditions and constraint qualifications: The convex case
• Title not available (Why is that?)

This page was built for publication: Calculating the cone of directions of constancy

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