Minimal representation of convex regions defined by analytic functions

DOI10.1006/jmaa.2000.6759zbMath1009.90086OpenAlexW1990697530MaRDI QIDQ1577971

Wiesława T. Obuchowska

Publication date: 27 August 2000

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.2000.6759

zbMATH Keywords

necessary and sufficient conditionsfeasible regionslinear and convex analytic constraints

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

On infeasibility of systems of convex analytic inequalities

Cites Work

• Numerical decomposition of a convex function
• Minimal representation of convex polyhedral sets
• Method of reduction in convex programming
• On the best case performance of hit and run methods for detecting necessary constraints
• Minimal representation of quadratically constrained convex feasible regions
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal representation of convex regions defined by analytic functions