The polynomial solvability of convex quadratic programming
From MaRDI portal
Cited in
(45)- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
- Mechanism design for correlated valuations: efficient methods for revenue maximization
- Packing under convex quadratic constraints
- Comparison of algorithms for simple stochastic games
- Packing under convex quadratic constraints
- Comparison of algorithms for simple stochastic games
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- The complexity of gradient descent: CLS = PPAD pls
- Reconstruction of uncertain historical evolution of the polysyllablization of Chinese lexis
- On probability-raising causality in Markov decision processes
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
- A scalable problem to benchmark robust multidisciplinary design optimization techniques
- Robust ordinal regression for subsets comparisons with interactions
- Foundations of probability-raising causality in Markov decision processes
- Active set methods with reoptimization for convex quadratic integer programming
- Polynomial-time algorithms for submodular Laplacian systems
- Computing Walrasian equilibria: fast algorithms and structural properties
- Space splitting convexification: a local solution method for nonconvex optimal control problems
- On the closest point to the origin in transportation polytopes
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- On the complexity of finding a local minimizer of a quadratic function over a polytope
- Integration of expert knowledge into radial basis function surrogate models
- On an approach to solving the time-optimization problem for linear discrete-time systems based on Krotov method
- A fast algorithm for non-negativity model selection
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- Statistical modeling under partial identification: distinguishing three types of identification regions in regression analysis with interval data
- Non-negative sparse recovery at minimal sampling rate
- Investigation of optimization methods and their applications
- The fairest core in cooperative games with transferable utilities
- Range assignment of base-stations maximizing coverage area without interference
- Efficient accuracy evaluation for multi-modal sensed data
- Lipschitz continuity and approximate equilibria
- Polyhedral aspects of stable marriage
- The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
- Computational aspects of the colorful Carathéodory theorem
- The stable b-matching polytope revisited
- Robust classification of dynamic bichromatic point sets in \(\mathbb{R}^2\)
- Guaranteed Error Bounds on Approximate Model Abstractions Through Reachability Analysis
- Passive nonlinear dendritic interactions as a computational resource in spiking neural networks
- Optimization of computations
- Formal lumping of polynomial differential equations through approximate equivalences
- The problem of identifying the model of substitution of production factors
- Convex quadratic sets and the complexity of mixed integer convex quadratic programming
- The clique problem for graphs with a few eigenvalues of the same sign
- Monotone learning with rectified wire networks
This page was built for publication: The polynomial solvability of convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3947451)
