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