Dávid Papp

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat The smallest mono-unstable, homogeneous convex polyhedron has at least 7 vertices 2024 Sándor Bozóki
G. Domokos
Dávid Papp
Krisztina Regős
+ PDF Chat Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size 2023 Maria M. Davis
Dávid Papp
+ The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices 2023 Dávid Papp
Krisztina Regős
G. Domokos
Sándor Bozóki
+ PDF Chat Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets 2022 Maria M. Davis
Dávid Papp
+ PDF Chat Duality of sum of nonnegative circuit polynomials and optimal SONC bounds 2022 Dávid Papp
+ PDF Chat Alfonso: Matlab Package for Nonsymmetric Conic Optimization 2021 Dávid Papp
Sercan Yıldız
+ alfonso: Matlab package for nonsymmetric conic optimization 2021 Dávid Papp
Sercan Yıldız
+ Semi‐Infinite Programming 2019 Dávid Papp
+ PDF Chat Sum-of-Squares Optimization without Semidefinite Programming 2019 Dávid Papp
Sercan Yıldız
+ PDF Chat Optimization of spatiotemporally fractionated radiotherapy treatments with bounds on the achievable benefit 2018 Melissa R. Gaddy
Sercan Yıldız
Jan Unkelbach
Dávid Papp
+ Approximations of the Models 2018 János Tóth
Attila Nagy
Dávid Papp
+ Solutions 2018 János Tóth
Attila Nagy
Dávid Papp
+ Inverse Problems 2018 János Tóth
Attila Nagy
Dávid Papp
+ Sum-of-squares optimization without semidefinite programming 2017 Dávid Papp
Sercan Yıldız
+ On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization" 2017 Dávid Papp
Sercan Yıldız
+ Univariate Polynomial Optimization with Sum-of-Squares Interpolants 2017 Dávid Papp
+ PDF Chat Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming 2017 Dávid Papp
+ PDF Chat On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization 2016 Dávid Papp
+ Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming 2015 Dávid Papp
+ PDF Chat Scenario generation for stochastic optimization problems via the sparse grid method 2015 Michael Chen
Sanjay Mehrotra
Dávid Papp
+ TH‐E‐BRF‐01: Exploiting Tumor Shrinkage in Split‐Course Radiotherapy 2014 Jan Unkelbach
David Craft
Theodore S. Hong
Dávid Papp
Jagdish Ramakrishnan
Ehsan Salari
John A. Wolfgang
Thomas Bortfeld
+ PDF Chat Exploiting tumor shrinkage through temporal optimization of radiotherapy 2014 Jan Unkelbach
David Craft
Theodore S. Hong
Dávid Papp
Jagdish Ramakrishnan
Ehsan Salari
John A. Wolfgang
Thomas Bortfeld
+ PDF Chat Shape-Constrained Estimation Using Nonnegative Splines 2014 Dávid Papp
Farid Alizadeh
+ PDF Chat A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization 2014 Sanjay Mehrotra
Dávid Papp
+ PDF Chat Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery 2013 Dávid Papp
Jan Unkelbach
+ A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization 2013 Sanjay Mehrotra
Dávid Papp
+ Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming 2013 Farid Alizadeh
Dávid Papp
+ Generating Moment Matching Scenarios Using Optimization Techniques 2013 S. C. Mehrotra
Dávid Papp
+ Semidefinite Characterization of Sum-of-Squares Cones in Algebras 2013 Dávid Papp
Farid Alizadeh
+ A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization 2013 S. C. Mehrotra
Dávid Papp
+ PDF Chat Optimal Designs for Rational Function Regression 2012 Dávid Papp
+ Generating nested quadrature formulas for general weight functions with known moments 2012 Sanjay Mehrotra
Dávid Papp
+ Scenario decomposition of risk-averse multistage stochastic programming problems 2011 Ricardo A. Collado
Dávid Papp
Andrzej Ruszczyński
+ Bilinear optimality constraints for the cone of positive polynomials 2011 Gábor Rudolf
Nilay Noyan
Dávid Papp
Farid Alizadeh
+ ReactionKinetics---A Mathematica Package with Applications I. Requirements for a Reaction Kinetics Package 2011 János Tóth
Attila Nagy
Dávid Papp
J Egry
+ ReactionKinetics - A Mathematica package with applications II. Computational problems when building a reaction kinetics package 2011 Attila Nagy
Dávid Papp
János Tóth
J Egry
+ OPTIMIZATION MODELS FOR SHAPE-CONSTRAINED FUNCTION ESTIMATION PROBLEMS INVOLVING NONNEGATIVE POLYNOMIALS AND THEIR RESTRICTIONS 2011 Dávid Papp
+ Optimal designs for rational function regression 2010 Dávid Papp
+ Bilinearity rank of the cone of positive polynomials and related cones 2009 Gábor Rudolf
Nilay Noyan
Dávid Papp
Farid Alizadeh
+ On the complexity of local search in unconstrained quadratic binary optimization 2007 Dávid Papp
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones 1999 J.F. Sturm
11
+ GloptiPoly 2003 Didier Henrion
Jean B. Lasserre
11
+ Squared functional systems and optimization problems 2000 Yu. Nesterov
8
+ Global Optimization with Polynomials and the Problem of Moments 2001 Jean B. Lasserre
8
+ PDF Chat Optimal Designs for Rational Function Regression 2012 Dávid Papp
8
+ SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 1999 Kim-Chuan Toh
Michael J. Todd
Reha Tütüncü
7
+ How bad are Hankel matrices? 1994 Evgenij E. Tyrtyshnikov
6
+ The condition number of real Vandermonde, Krylov and positive definite Hankel matrices 2000 Bernhard Beckermann
6
+ A Mathematical View of Interior-Point Methods in Convex Optimization 2001 James Renegar
6
+ OPTIMIZATION MODELS FOR SHAPE-CONSTRAINED FUNCTION ESTIMATION PROBLEMS INVOLVING NONNEGATIVE POLYNOMIALS AND THEIR RESTRICTIONS 2011 Dávid Papp
6
+ Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming 2013 Farid Alizadeh
Dávid Papp
6
+ Semidefinite Programming 1996 Lieven Vandenberghe
Stephen Boyd
5
+ PDF Chat Sum-of-Squares Optimization without Semidefinite Programming 2019 Dávid Papp
Sercan Yıldız
5
+ Interior-Point Polynomial Algorithms in Convex Programming 1994 Yurii Nesterov
Arkadi Nemirovski
5
+ Arrival Rate Approximation by Nonnegative Cubic Splines 2007 Farid Alizadeh
Jonathan Eckstein
Nilay Noyan
Gábor Rudolf
5
+ CSDP, A C library for semidefinite programming 1999 Brian Borchers
5
+ Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity 2006 Hayato Waki
Sunyoung Kim
Masakazu Kojima
Masakazu Muramatsu
5
+ Approximation Theory and Approximation Practice 2013 Lloyd N. Trefethen
5
+ Semidefinite programming relaxations for semialgebraic problems 2003 Pablo A. Parrilo
5
+ New upper bounds for kissing numbers from semidefinite programming 2007 Christine Bachoc
Frank Vallentin
5
+ PDF Chat Shape-Constrained Estimation Using Nonnegative Splines 2014 Dávid Papp
Farid Alizadeh
4
+ Convex Optimization 2004 Stephen Boyd
Lieven Vandenberghe
4
+ PDF Chat Optimal Power Flow as a Polynomial Optimization Problem 2015 Bissan Ghaddar
Jakub Mareček
Martin Mevissen
4
+ Second-order cone programming 2003 Farid Alizadeh
Donald Goldfarb
4
+ PDF Chat The complexity of optimizing over a simplex, hypercube or sphere: a short survey 2007 Etienne de Klerk
4
+ From coefficients to samples: a new approach to SOS optimization 2004 Johan Löfberg
Pablo A. Parrilo
4
+ Lectures on Modern Convex Optimization 2001 Aharon Ben‐Tal
Arkadi Nemirovski
4
+ Optimization Problems over Positive Pseudopolynomial Matrices 2003 Y. Genin
Yvan Hachez
Yu. Nesterov
Paul Van Dooren
4
+ Versch�rfung des ersten Mittelwertsatzes der Integralrechnung f�r rationale Polynome 1918 Franz Luk�cs
4
+ The Moment Problem on Compact Semi-Algebraic Sets 2017 Konrad Schmüdgen
4
+ A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems 1993 K. O. Kortanek
Hoon. No
4
+ PDF Chat A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization 2014 Sanjay Mehrotra
Dávid Papp
4
+ Analysis on Symmetric Cones 1994 Jacques Faraut
Adam Korányi
4
+ PDF Chat The Minnesota Notes on Jordan Algebras and Their Applications 1999 Max Koecher
4
+ Positive polynomials and sums of squares 2008 Murray Marshall
3
+ PDF Chat A note on the summation of Chebyshev series 1955 C. W. Clenshaw
3
+ Generating Moment Matching Scenarios Using Optimization Techniques 2013 S. C. Mehrotra
Dávid Papp
3
+ Semidefinite Characterization of Sum-of-Squares Cones in Algebras 2013 Dávid Papp
Farid Alizadeh
3
+ Structured Matrices and Polynomials: Unified Superfast Algorithms 2001 Victor Y. Pan
3
+ Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization 2000 Pablo A. Parrilo
3
+ Numerical Methods for Special Functions 2007 Amparo Gil
Javier Segura
Nico Μ. Τemme
3
+ On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization" 2017 Dávid Papp
Sercan Yıldız
3
+ PDF Chat Optimal Designs for a Class of Polynomials of Odd or Even Degree 1992 Holger Dette
3
+ PDF Chat A homogeneous interior-point algorithm for nonsymmetric convex conic optimization 2014 Anders Skajaa
Yinyu Ye
3
+ Theory of Approximation of Functions of a Real Variable 1963 A.F. TIMAN
3
+ Semi-Infinite Programming: Theory, Methods, and Applications 1993 R. Hettich
K. O. Kortanek
3
+ An accelerated central cutting plane algorithm for linear semi-infinite programming 2004 Bruno Betr�
3
+ PDF Chat Barycentric Lagrange Interpolation 2004 Jean‐Paul Berrut
Lloyd N. Trefethen
3
+ PDF Chat Representing polynomials by positive linear functions on compact convex polyhedra 1988 David Handelman
3
+ Bilinearity rank of the cone of positive polynomials and related cones 2009 Gábor Rudolf
Nilay Noyan
Dávid Papp
Farid Alizadeh
3