Approximating a solution set of nonlinear inequalities
From MaRDI portal
Publication:1754455
DOI10.1007/s10898-017-0576-zzbMath1402.90177OpenAlexW2766963966MaRDI QIDQ1754455
Larisa Rybak, Mikhail A. Posypkin, Andrei Turkin, Yuri G. Evtushenko
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0576-z
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
The Method of Optimal Geometric Parameters Synthesis of Two Mechanisms in the Rehabilitation System on Account of Relative Position ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Optimization algorithm for approximating the solutions set of nonlinear inequalities systems in the problem of determining the robot workspace ⋮ Model predictive monitoring of dynamical systems for signal temporal logic specifications ⋮ The scalability analysis of a parallel tree search algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- A filter algorithm for nonlinear systems of equalities and inequalities
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
- A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities
- Set inversion via interval analysis for nonlinear bounded-error estimation
- Parallel robots
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Effective hull of a set and its approximation
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Simplicial Global Optimization
- Generation of three-dimensional delaunay meshes from weakly structured and inconsistent data
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- The modified method of refined bounds for polyhedral approximation of convex polytopes
- Introduction to Interval Analysis
- Interval Methods for Systems of Equations
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Nonlinear programming without a penalty function.
- Cutting methods in E n+ 1 for global optimization of a class of functions
This page was built for publication: Approximating a solution set of nonlinear inequalities
