scientific article; zbMATH DE number 429516
From MaRDI portal
Publication:3137900
zbMATH Open0785.90091MaRDI QIDQ3137900FDOQ3137900
Authors: Stephen A. Vavasis 
Publication date: 11 October 1993
Title of this publication is not available (Why is that?)
Recommendations
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)
Cited In (78)
- Continuous cubic formulations for cluster detection problems in networks
- Computing the spectral decomposition of interval matrices and a study on interval matrix powers
- Maximization of a PSD quadratic form and factorization
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
- Algorithm 1030: SC-SR1: MATLAB software for limited-memory SR1 trust-region methods
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Using expert knowledge in solving the seismic inverse problem
- Nonlinear material decomposition using a regularized iterative scheme based on the Bregman distance
- Post-boosting of classification boundary for imbalanced data using geometric mean
- A strongly polynomial algorithm for a new class of linear inequalities1
- Enclosing the solution set of the parametric generalised Sylvester matrix equation \(A(p) XB (p) + C(p) XD (p) = F(p)\)
- How to divide a territory? A new simple differential formalism for optimization of set functions
- The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations
- Rigorous convex underestimators for general twice-differentiable problems
- Quadratic programming and combinatorial minimum weight product problems
- Discussion on: ``Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints
- Bootstrap methods for epistemic fuzzy data
- Estimating information amount under uncertainty: algorithmic solvability and computational complexity
- Marginally parameterized spatio-temporal models and stepwise maximum likelihood estimation
- 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
- Tensors in computations
- Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms
- A fast memoryless interval-based algorithm for global optimization
- 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
- The complexity of optimization problems
- Linear interval parametric approach to testing pseudoconvexity
- DC programming and DCA: thirty years of developments
- Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- 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
- On the optimal correction of infeasible systems of linear inequalities
- An improved column generation algorithm for minimum sum-of-squares clustering
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- The exact solution of multiparametric quadratically constrained quadratic programming problems
- A continuous approch for globally solving linearly constrained quadratic
- Spherical coverage verification
- Distance geometry and data science
- A new polynomially solvable class of quadratic optimization problems with box constraints
- A polynomial time algorithm for Zero-Clairvoyant scheduling
- A storm of feasibility pumps for nonconvex MINLP
- Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
- On a decision procedure for quantified linear programs
- Monte-Carlo-type techniques for processing interval uncertainty, and their potential engineering applications
- 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
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- Nonconvex phase synchronization
- Multiobjective \(L_1/H_\infty\) controller design for systems with frequency and time domain constraints
- Exact and heuristic algorithms for semi-nonnegative matrix factorization
- New formulations of the multiple sequence alignment problem
- Outlier detection under interval uncertainty: algorithmic solvability and computational complexity
- Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard
- 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
- Eigenvalue analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB
- Title not available (Why is that?)
- 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
- Structured singular value controller synthesis using constant D-scales without D-K iteration
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- Data science applications to string theory
- Title not available (Why is that?)
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)
