Linear interval parametric approach to testing pseudoconvexity
From MaRDI portal
Publication:2022238
DOI10.1007/s10898-020-00924-wzbMath1465.90072OpenAlexW3045856695MaRDI QIDQ2022238
Iwona Skalna, Milan Hladík, Lubomir V. Kolev
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00924-w
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized solution of linear interval parametric systems
- Handbook of generalized convexity and generalized monotonicity
- Testing pseudoconvexity via interval computation
- New methods for calculating \(\alpha\)BB-type underestimators
- Outer interval solution of the eigenvalue problem under general form parametric dependencies
- Quadratic programming with one negative eigenvalue is NP-hard
- Matrix criteria for pseudo-convex functions in the class \(C^2\)
- Several NP-hard problems arising in robust stability analysis
- Computational complexity and feasibility of data processing and interval computations
- Exact solution to a parametric linear programming problem
- A new method for computing a \(p\)-solution to parametric interval linear systems with affine-linear and nonlinear dependencies
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms
- Parametric interval algebraic systems
- Checking robust nonsingularity is NP-hard
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Deterministic global optimization. Theory, methods and applications
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- Relations between various methods for solving linear interval and parametric equations
- Introduction to nonlinear and global optimization
- Bounds on Real Eigenvalues and Singular Values of Interval Matrices
- Eigenvalue range determination for interval and parametric matrices
- Interval computations, rigour and non-rigour in deterministic continuous global optimization
- Introduction to Interval Analysis
- Matrix Analysis
- On second order conditions for quasiconvexity
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- Interval Methods for Systems of Equations
- Second order characterizations of pseudoconvex functions
- Sufficient Conditions for Regularity and Singularity of Interval Matrices
- Strong regularity of parametric interval matrices
- An Introduction to Affine Arithmetic
- Second Order Conditions for Pseudo-Convex Functions
- Mathematical programming problems with quasi-convex objective functions
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
This page was built for publication: Linear interval parametric approach to testing pseudoconvexity