scientific article; zbMATH DE number 4001882

MaRDI QIDQ3754444zbMATH OpenFDO

Authors Miroslav D. Asic, Vera Kovačević-Vujčić

Publication date 1986

zbMATH Keywords

computational complexityselective discretization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Recommendations

• Complexity aspects of a semi-infinite optimization problem†
• On the complexity of semidefinite programs
• On Computational Complexity of Semilinear Varieties
• Semi-Infinite Programming: Theory, Methods, and Applications
• scientific article; zbMATH DE number 1275849
• Feasible method for semi-infinite programs
• On Linear Semi-Infinite Programming Problems: An Algorithm
• scientific article; zbMATH DE number 1944141
• The complexity of semilinear problems in succinct representation
• Semidefinite programming and its applications to NP problems

Cited in

(5)

• On the complexity of semidefinite programs
• An implicit enumeration method for global optimization problems
• scientific article; zbMATH DE number 3999652 (Why is no real title available?)
• A solution method for combined semi-infinite and semi-definite programming
• The complexity of semilinear problems in succinct representation

This page was built for publication:

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