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