Complexity aspects of a semi-infinite optimization problem†

DOI10.1080/02331930701779013MaRDI QIDQ5449018zbMATH OpenOpenAlexFDO

Authors Klaus Meer

Publication date 10 March 2008

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930701779013

zbMATH Keywords

complexity classesinterval arithmeticsemi-infinite optimization

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Semi-infinite programming (90C34)

Cites work

• A new polynomial-time algorithm for linear programming
• Connections between generalized, inexact and semi-infinite linear programming
• Enclosing solutions of linear interval equations is NP-hard
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• New NP-hard and NP-complete polynomial and integer divisibility problems
• On a refined analysis of some problems in interval arithmetic using real number complexity theory
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the complexity of quadratic programming in real number models of computation
• Separation of complexity classes in Koiran's weak model
• The polynomial-time hierarchy

Cited in

(2)

• How to solve a semi-infinite optimization problem
• scientific article; zbMATH DE number 4001882 (Why is no real title available?)

This page was built for publication: Complexity aspects of a semi-infinite optimization problem†

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