Unsolvability of some optimization problems

DOI10.1016/J.AMC.2005.05.025zbMATH Open1098.65071OpenAlexW2025143983MaRDI QIDQ2489339FDOQ2489339

Authors: Wenxing Zhu 

Publication date: 16 May 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.05.025

Recommendations

• Undecidability in number theory
• Global Optimization over Unbounded Domains
• Questions of decidability and undecidability in Number Theory
• scientific article; zbMATH DE number 42574
• scientific article; zbMATH DE number 1261118

zbMATH Keywords

Global optimizationConstraint satisfactionNonlinear equationsInteger programmingUnsolvability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Integer programming (90C10) Numerical computation of solutions to systems of equations (65H10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• A new parameter free filled function for solving unconstrained global optimization problems
• Unsolvability Cores in Classification Problems
• A new parameter-free continuously differentiable filled function algorithm for solving nonlinear equations and data fitting problems
• Title not available (Why is that?)
• Dynamic globally concavized filled function method for continuous global optimization
• Optimisation impossible
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Symmetry in mathematical programming
• A new filled function for global minimization and system of nonlinear equations

This page was built for publication: Unsolvability of some optimization problems

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