scientific article; zbMATH DE number 429516
From MaRDI portal
Publication:3137900
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
Cited in
(85)- The complexity of optimization problems
- Fast suboptimal predictive control with guaranteed stability
- The complexity of computation and approximation of the t-ratio over one-dimensional interval data
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Global probability maximization for a Gaussian bilateral inequality in polynomial time
- A DEA ranking method based on cross-efficiency intervals and signal-to-noise ratio
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- DC programming and DCA: thirty years of developments
- A polyhedral study of nonconvex quadratic programs with box constraints
- Interval convex quadratic programming problems in a general form
- Rigorous convex underestimators for general twice-differentiable problems
- A storm of feasibility pumps for nonconvex MINLP
- The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations
- Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- Linear interval parametric approach to testing pseudoconvexity
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- On the optimal correction of infeasible systems of linear inequalities
- A new polynomially solvable class of quadratic optimization problems with box constraints
- Continuous cubic formulations for cluster detection problems in networks
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Bootstrap methods for epistemic fuzzy data
- Post-boosting of classification boundary for imbalanced data using geometric mean
- Data science applications to string theory
- Distance geometry and data science
- Maximization of a PSD quadratic form and factorization
- Computing the spectral decomposition of interval matrices and a study on interval matrix powers
- Eigenvalue analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems
- Using expert knowledge in solving the seismic inverse problem
- Quadratic optimization over one first-order cone
- On a decision procedure for quantified linear programs
- A polynomial time algorithm for Zero-Clairvoyant scheduling
- Computing population variance and entropy under interval uncertainty: Linear-time algorithms
- Outlier detection under interval uncertainty: algorithmic solvability and computational complexity
- Exact bounds on finite populations of interval data
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- A continuous approch for globally solving linearly constrained quadratic
- Global solutions to folded concave penalized nonconvex learning
- Nonconvex phase synchronization
- A mathematical programming approach to sample coefficient of variation with interval-valued observations
- Exact and heuristic algorithms for semi-nonnegative matrix factorization
- A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Estimating information amount under uncertainty: algorithmic solvability and computational complexity
- Optimal configuration of a decentralized, market-driven production/inventory system
- The complexity of a special convex programming problem connected with nonlinear optimization
- Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints
- Discussion on: ``Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints
- How to divide a territory? A new simple differential formalism for optimization of set functions
- scientific article; zbMATH DE number 501506 (Why is no real title available?)
- Spherical coverage verification
- Nonlinear material decomposition using a regularized iterative scheme based on the Bregman distance
- Black-Box Complexity of Local Minimization
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- A strongly polynomial algorithm for a new class of linear inequalities1
- scientific article; zbMATH DE number 846225 (Why is no real title available?)
- Structured singular value controller synthesis using constant D-scales without D-K iteration
- Robust location transportation problems under uncertain demands
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- Enclosing the solution set of the parametric generalised Sylvester matrix equation \(A(p) XB (p) + C(p) XD (p) = F(p)\)
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- Cubature, approximation, and isotropy in the hypercube
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Tensors in computations
- New formulations of the multiple sequence alignment problem
- Algorithm 1030: SC-SR1: MATLAB software for limited-memory SR1 trust-region methods
- An improved column generation algorithm for minimum sum-of-squares clustering
- Norm-induced cuts: outer approximation for Lipschitzian constraint functions
- Regularized standard polynomial programming formulations for the maximum clique problem
- Grassmannian optimization is NP-hard
- Global approximation of local optimality: nonsubmodular optimization
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- A concise and friendly introduction to the analysis of algorithms for continuous nonlinear optimization
- Stiefel optimization is NP-hard
- Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB
- Marginally parameterized spatio-temporal models and stepwise maximum likelihood estimation
- Monte-Carlo-type techniques for processing interval uncertainty, and their potential engineering applications
- Ellipsoids and ellipsoid-shaped fuzzy sets as natural multi-variate generalization of intervals and fuzzy numbers: how to elicit them from users, and how to use them in data processing
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- A fast memoryless interval-based algorithm for global optimization
- Quadratic programming and combinatorial minimum weight product problems
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 Q3137900)
