scientific article; zbMATH DE number 757674

MaRDI QIDQ4833803zbMATH OpenFDO

Authors Stephen A. Vavasis

Publication date 23 May 1995

zbMATH Keywords

approximation algorithmscomplexity theoryhardness resultsnonconvex problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 429516
• Complexity and algorithms for nonlinear optimization problems
• scientific article; zbMATH DE number 846225

Cited in

(30)

• Complexity results for some global optimization problems
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• A MIQCP formulation for B-spline constraints
• On the convergence rate issues of general Markov search for global minimum
• Approximation algorithm for a class of global optimization problems
• Global optimization problems and domain reduction strategies
• An adaptive procedure for the global minimization of a class of polynomial functions
• Hybrid control for tracking environmental level sets by nonholonomic robots in maze-like environments
• Quantitative measure of nonconvexity for black-box continuous functions
• Dynamic search trajectory methods for global optimization
• Complexity and algorithms for nonlinear optimization problems
• The robust constant and its applications in random global search for unconstrained global optimization
• On the complexity of nonlinear mixed-integer optimization
• The robust constant and its applications in global optimization
• On the asymptotic tractability of global optimization
• scientific article; zbMATH DE number 429516 (Why is no real title available?)
• The effectiveness of finite improvement algorithms for finding global optima
• Studies of multi-start clustering for global optimization
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Conflict Analysis for MINLP
• A Lipschitz Matrix for Parameter Reduction in Computational Science
• Constrained, global optimization of unknown functions with Lipschitz continuous gradients
• Some recent developments in deterministic global optimization
• Surrogate-Based Reduced-Dimension Global Optimization in Process Systems Engineering
• On average complexity of global optimization problems
• Kernel sum of squares for data adapted kernel learning of dynamical systems from data: a global optimization approach
• Properties and numerical testing of a parallel global optimization algorithm
• A particle consensus approach to solving nonconvex-nonconcave min-max problems
• Non-gradient based navigation of nonholonomic underactuated robots for seeking and tracking of extended sources
• On complexity of a global optimization problem

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 Q4833803)