scientific article

Publication date: 11 October 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

black-box model convex and nonconvex quadratic programming

Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items

Tensors in computations, Global solutions to folded concave penalized nonconvex learning, The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data, Marginally parameterized spatio-temporal models and stepwise maximum likelihood estimation, A mathematical programming approach to sample coefficient of variation with interval-valued observations, On-line algorithms for computing mean and variance of interval data, and their use in intelligent systems, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, Using expert knowledge in solving the seismic inverse problem, Nonlinear material decomposition using a regularized iterative scheme based on the Bregman distance, Monte-Carlo-type techniques for processing interval uncertainty, and their potential engineering applications, A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty, Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization, Bootstrap methods for epistemic fuzzy data, 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, Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains, A strongly polynomial algorithm for a new class of linear inequalities¹, Global probability maximization for a Gaussian bilateral inequality in polynomial time, Post-boosting of classification boundary for imbalanced data using geometric mean, Optimal configuration of a decentralized, market-driven production/inventory system, A storm of feasibility pumps for nonconvex MINLP, 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, Cubature, Approximation, and Isotropy in the Hypercube, Data science applications to string theory, Distance geometry and data science, New formulations of the multiple sequence alignment problem, Spherical coverage verification, A DEA ranking method based on cross-efficiency intervals and signal-to-noise ratio, Quadratic optimization over one first-order cone, Structured singular value controller synthesis using constant D-scales without D-K iteration, Convergence analysis of difference-of-convex algorithm with subanalytic data, An improved column generation algorithm for minimum sum-of-squares clustering, Maximization of a PSD quadratic form and factorization, The complexity of optimizing over a simplex, hypercube or sphere: a short survey, On a decision procedure for quantified linear programs, Robust location transportation problems under uncertain demands, Computing the spectral decomposition of interval matrices and a study on interval matrix powers, The exact extreme response and the confidence extreme response analysis of structures subjected to uncertain-but-bounded excitations, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, DC programming and DCA: thirty years of developments, A polynomial time algorithm for Zero-Clairvoyant scheduling, Estimating information amount under uncertainty: algorithmic solvability and computational complexity, Computing population variance and entropy under interval uncertainty: Linear-time algorithms, Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard, Outlier detection under interval uncertainty: algorithmic solvability and computational complexity, Exact bounds on finite populations of interval data, A continuous approch for globally solving linearly constrained quadratic, A fast memoryless interval-based algorithm for global optimization, A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains, Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation, A polyhedral study of nonconvex quadratic programs with box constraints, How to divide a territory? A new simple differential formalism for optimization of set functions, The exact solution of multiparametric quadratically constrained quadratic programming problems, Linear interval parametric approach to testing pseudoconvexity, Quadratic programming and combinatorial minimum weight product problems, Computing mean and variance under Dempster-Shafer uncertainty: towards faster algorithms, Interval convex quadratic programming problems in a general form, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, Eigenvalue analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB, Static response analysis of structures with interval parameters using the second-order Taylor series expansion and the DCA for QB, 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, Rigorous convex underestimators for general twice-differentiable problems, Fast suboptimal predictive control with guaranteed stability, DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology, Nonconvex Phase Synchronization, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Continuous cubic formulations for cluster detection problems in networks, 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)