Minimal representation of convex regions defined by analytic functions

DOI10.1006/JMAA.2000.6759MaRDI QIDQ1577971zbMATH OpenOpenAlexFDO

Authors W. 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)

Recommendations

• Representation of analytic functions in bounded convex domains on the complex plane
• A minimum problem in the theory of analytic functions
• Convex approximations of analytic functions
• Minimal interpolation in spaces of analytic functions
• On convex and analytic functions
• Functional analytic characterizations of classes of convex bodies
• scientific article; zbMATH DE number 19322
• Complex convexity and analytic functionals
• On convex combinations of analytic functions
• scientific article; zbMATH DE number 3903422

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 3653840 (Why is no real title available?)
• scientific article; zbMATH DE number 3668321 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3227305 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• Method of reduction in convex programming
• Minimal representation of convex polyhedral sets
• Minimal representation of quadratically constrained convex feasible regions
• Numerical decomposition of a convex function
• On the best case performance of hit and run methods for detecting necessary constraints

Cited in

(2)

• Representability of functions
• On infeasibility of systems of convex analytic inequalities

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

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