The following pages link to David Papp (Q378748):
Displaying 25 items.
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming (Q378749) (← links)
- (Q717130) (redirect page) (← links)
- Bilinear optimality constraints for the cone of positive polynomials (Q717131) (← links)
- Acyclic, or totally tight, two-person game forms: characterization and main properties (Q966009) (← links)
- Univariate polynomial optimization with sum-of-squares interpolants (Q1695087) (← links)
- Scenario decomposition of risk-averse multistage stochastic programming problems (Q1931651) (← links)
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds (Q2156369) (← links)
- Effective solution of linear Diophantine equation systems with an application in chemistry (Q2503714) (← links)
- On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization (Q2810549) (← links)
- Generating Moment Matching Scenarios Using Optimization Techniques (Q2848181) (← links)
- Semidefinite Characterization of Sum-of-Squares Cones in Algebras (Q2866191) (← links)
- Sum-of-Squares Optimization without Semidefinite Programming (Q4629344) (← links)
- (Q4670517) (← links)
- Optimal Designs for Rational Function Regression (Q4916472) (← links)
- Zero Initialized Active Learning with Spectral Clustering using Hungarian Method (Q5016615) (← links)
- Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets (Q5043282) (← links)
- Polinomiális optimalizálási feladatok és relaxációik (Q5065337) (← links)
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization (Q5084625) (← links)
- (Q5155456) (← links)
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization (Q5245362) (← links)
- Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming (Q5355202) (← links)
- Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size (Q6051120) (← links)
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)
- alfonso: Matlab package for nonsymmetric conic optimization (Q6358073) (← links)
- The smallest mono-unstable, homogeneous convex polyhedron has at least 7 vertices (Q6519721) (← links)
