46 citations · 116 across the 14 of their papers we have counts for
16 papers
Rational Dual Certificates for Weighted Sums-of-Squares Polynomials with Boundable Bit Size
Maria M. Davis, Dávid Papp
In (Davis and Papp, 2022), the authors introduced the concept of dual certificates of (weighted) sum-of-squares polynomials, which are vectors from the dual cone of weighted sums o…
The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
Dávid Papp, Krisztina Regős, Gábor Domokos +1
In the study of monostatic polyhedra, initiated by John H. Conway in 1966, the main question is to construct such an object with the minimal number of faces and vertices. By distin…
Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
Maria M. Davis, Dávid Papp
We study the problem of computing weighted sum-of-squares (WSOS) certificates for positive polynomials over a compact semialgebraic set. Building on the theory of interior-point me…
alfonso: Matlab package for nonsymmetric conic optimization
Dávid Papp, Sercan Yıldız
We present alfonso, an open-source Matlab package for solving conic optimization problems over nonsymmetric convex cones. The implementation is based on the authors' corrected anal…
Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
Dávid Papp
Circuit polynomials are polynomials satisfying a number of conditions that make it easy to compute sharp and certifiable global lower bounds for them. Consequently, one may use the…
Optimization of spatiotemporally fractionated radiotherapy treatments with bounds on the achievable benefit
Melissa R. Gaddy, Sercan Yıldız, Jan Unkelbach +1
Spatiotemporal fractionation schemes, that is, treatments delivering different dose distributions in different fractions, may lower treatment side effects without compromising tumo…
Sum-of-squares optimization without semidefinite programming
Dávid Papp, Sercan Yıldız
We propose a homogeneous primal-dual interior-point method to solve sum-of-squares optimization problems by combining non-symmetric conic optimization techniques and polynomial int…
On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"
Dávid Papp, Sercan Yıldız
In a recent paper, Skajaa and Ye proposed a homogeneous primal-dual interior-point method for non-symmetric conic optimization. The authors showed that their algorithm converges to…
Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
Dávid Papp
In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interv…
Exploiting tumor shrinkage through temporal optimization of radiotherapy
Jan Unkelbach, David Craft, Theodore Hong +5
In multi-stage radiotherapy, a patient is treated in several stages separated by weeks or months. This regimen has been motivated mostly by radiobiological considerations, but also…
Averaging VMAT treatment plans for multi-criteria navigation
David Craft, David Papp, Jan Unkelbach
The main approach to smooth Pareto surface navigation for radiation therapy multi-criteria treatment planning involves taking real-time averages of pre-computed treatment plans. In…
Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery
Dávid Papp, Jan Unkelbach
We propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization…
A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization
Sanjay Mehrotra, David Papp
We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop a novel algorithm for distributionally robu…
Generating nested quadrature formulas for general weight functions with known moments
Sanjay Mehrotra, Dávid Papp
We revisit the problem of extending quadrature formulas for general weight functions, and provide a generalization of Patterson's method for the constant weight function. The metho…
Optimal designs for rational function regression
Dávid Papp
We consider optimal non-sequential designs for a large class of (linear and nonlinear) regression models involving polynomials and rational functions with heteroscedastic noise als…
On the complexity of local search in unconstrained quadratic binary optimization
Dávid Papp
We consider the problem of finding a local minimum of a binary quadratic function, and show by an elementary construction that every descending local search algorithm takes exponen…