All Stories

  1. Exploiting Constant Trace Property in Large-scale Polynomial Optimization
  2. CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization
  3. On Moment Problems with Holonomic Functions
  4. Modeling crack discontinuities without element-partitioning in the extended finite element method
  5. Computing Gaussian & exponential measures of semi-algebraic sets
  6. Modeling crack discontinuities without element-partitioning in the extended finite element method
  7. Bound-Constrained Polynomial Optimization Using Only Elementary Calculations
  8. Exact Solutions to Super Resolution on Semi-Algebraic Domains in Higher Dimensions
  9. Positivity Certificates in Optimal Control
  10. Modeling crack discontinuities without element-partitioning in the extended finite element method
  11. Fast and Accurate Computation of Orbital Collision Probability for Short-Term Encounters
  12. Lebesgue decomposition in action via semidefinite relaxations
  13. A MAX-CUT formulation of 0/1 programs
  14. Convex Optimization and Parsimony of $L_p$-balls Representation
  15. Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
  16. Linear Conic Optimization for Inverse Optimal Control
  17. Semidefinite Approximations of the Polynomial Abscissa
  18. Algebraic–exponential Data Recovery from Moments
  19. Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra
  20. Moments and Legendre-Fourier Series for Measures Supported on Curves
  21. A bounded degree SOS hierarchy for polynomial optimization
  22. Minimizing the sum of many rational functions
  23. Volume of slices and sections of the simplex in closed form
  24. Optimization as motion selection principle in robot action
  25. The 2013 Newton Institute Programme on polynomial optimization
  26. Level Sets and NonGaussian Integrals of Positively Homogeneous Functions
  27. An Introduction to Polynomial and Semi-Algebraic Optimization
  28. Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
  29. Tractable approximations of sets defined with quantifiers
  30. Inverse optimal control with polynomial optimization
  31. Rank-Constrained Fundamental Matrix Estimation by Polynomial Global Optimization Versus the Eight-Point Algorithm
  32. A Unified Framework for Solving a General Class of Conditional and Robust Set-Membership Estimation Problems
  33. Optimality in robot motion
  34. Approximating Pareto curves using semidefinite relaxations
  35. A generalization of Löwner-John’s ellipsoid theorem
  36. A New Method to Compute the Probability of Collision for Short-term Space Encounters
  37. On Polynomial Optimization Over Non-compact Semi-algebraic Sets
  38. Measures and LMIs for Impulsive Nonlinear Optimal Control
  39. Erratum to: On convex optimization without convex representation
  40. Mean Squared Error Minimization for Inverse Moment Problems
  41. A Lagrangian relaxation view of linear and semidefinite hierarchies
  42. A generalization of the Löwner-John's ellipsoid theorem
  43. Moment LMI approach to LTV impulsive control
  44. Lower bounds on the global minimum of a polynomial
  45. Borel measures with a density on a compact semi-algebraic set
  46. A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
  47. Recovering an Homogeneous Polynomial from Moments of Its Level Set
  48. Inverse Polynomial Optimization
  49. Corrigendum to “The truncated K-moment problem for closure of open sets” [J. Funct. Anal. 263 (11) (2012) 3604–3616]
  50. Moment matrices, border bases and real radical computation
  51. Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
  52. Analytic perturbation of generalized inverses
  53. New approximations for the cone of copositive matrices and its dual
  54. Structured Function Systems and Applications
  55. The truncated K-moment problem for closure of open sets
  56. The $\mathbf {K}$-moment problem for continuous linear functionals
  57. Convex underestimators of polynomials
  58. Measures and LMI for impulsive optimal control with applications to space rendezvous problems
  59. Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
  60. The existence of Gaussian cubature formulas
  61. The Inverse Moment Problem for Convex Polytopes
  62. Modern Optimization Modelling Techniques
  63. Chapter 3 Polynomial Optimization
  64. Chapter 5 Parametric Polynomial Optimization
  65. Chapter 2 Moments
  66. Chapter 1 Representation of Positive Polynomials
  67. Chapter 4 Convexity in Polynomial Optimization
  68. Handbook on Semidefinite, Conic and Polynomial Optimization
  69. Inverse polynomial optimization
  70. Convex underestimators of polynomials
  71. A “joint + marginal” heuristic for 0/1 programs
  72. A “Joint+Marginal” Approach in Optimization
  73. Positivity and Optimization: Beyond Polynomials
  74. Introduction to Semidefinite, Conic and Polynomial Optimization
  75. Bounding the support of a measure from its marginal moments
  76. A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
  77. On convex optimization without convex representation
  78. An algorithm for semi-infinite polynomial optimization
  79. Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations
  80. Min-max and robust polynomial optimization
  81. A “joint+marginal” algorithm for polynomial optimization
  82. L p -Norms, Log-Barriers and Cramer Transform in Optimization
  83. Certificates of convexity for basic semi-algebraic sets
  84. Semidefinite programming for min–max problems and games
  85. Positivity and Optimization for Semi-Algebraic Functions
  86. A “Joint+Marginal” Approach to Parametric Polynomial Optimization
  87. Discrete-time stochastic optimal control via occupation measures and moment relaxations
  88. Approximate Volume and Integration for Basic Semialgebraic Sets
  89. On representations of the feasible set in convex optimization
  90. Moments, Positive Polynomials and Their Applications
  91. GloptiPoly 3: moments, optimization and semidefinite programming
  92. A prolongation–projection algorithm for computing the finite real variety of an ideal
  93. Moments and sums of squares for polynomial optimization and related problems
  94. Linear and Integer Programming vs Linear Integration and Counting
  95. Introduction
  96. Duality and Gomory Relaxations
  97. A Discrete Farkas Lemma
  98. Duality and Superadditive Functions
  99. Duality and a Farkas lemma for integer programs
  100. Convexity in SemiAlgebraic Geometry and Polynomial Optimization
  101. The Linear Integration Problem I
  102. Comparing the Continuous Problems P and I
  103. The Linear Counting Problem Id
  104. Relating the Discrete Problems Pd and Id with P
  105. Barvinok’s Counting Algorithm and Gomory Relaxations
  106. The Integer Hull of a Convex Rational Polytope
  107. A Unified Approach to Computing Real and Complex Zeros of Zero-Dimensional Ideals
  108. Representation of nonnegative convex polynomials
  109. Measures with zeros in the inverse of their moment matrix
  110. Convex sets with semidefinite representation
  111. Approximating integrals of multivariate exponentials: A moment approach
  112. Nonlinear optimal control synthesis via occupation measures
  113. Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
  114. Computing the real variety of an ideal
  115. Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
  116. Sufficient conditions for a real polynomial to be a sum of squares
  117. The K-moment problem with densities
  118. A semidefinite programming approach to the generalized problem of moments
  119. A Sum of Squares Approximation of Nonnegative Polynomials
  120. Semidefinite programming for gradient and Hessian computation in maximum entropy estimation
  121. SOS approximations of nonnegative polynomials via simple high degree perturbations
  122. PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
  123. LMIs for constrained polynomial interpolation with application in trajectory planning
  124. Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
  125. Convergent SDP-Relaxations for Polynomial Optimization with Sparsity
  126. Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
  127. A Sum of Squares Approximation of Nonnegative Polynomials
  128. Robust global optimization with polynomials
  129. A Moment Approach to Analyze Zeros of Triangular Polynomial Sets
  130. Detecting Global Optimality and Extracting Solutions in GloptiPoly
  131. An Alternative Algorithm for Counting Lattice Points in a Convex Polytope
  132. Hierarchical scheduling for decision support
  133. Erratum to “Generating functions and duality for integer programs”
  134. Polynomial Programming: LP-Relaxations Also Converge
  135. Integer programming, duality and superadditive functions
  136. Sum of Squares Approximation of Polynomials, Nonnegative on a Real Algebraic Set
  137. SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
  138. Generating functions and duality for integer programs
  139. A discrete Farkas lemma
  140. Feature - How gloptipoly is applied to problems in robust and nonlinear control Solving nonconvex optimization problems
  141. The Integer Hull of a Convex Rational Polytope
  142. Characterizing Polynomials With Roots in a Semialgebraic Set
  143. Integer programming, Barvinok's counting algorithm and Gomory relaxations
  144. Correction
  145. Integer programming duality
  146. On Counting Integral Points in a Convex Rational Polytope
  147. GloptiPoly
  148. Markov Chains and Invariant Probabilities
  149. Preliminaries
  150. Feller Markov Chains
  151. Strong and Uniform Ergodicity
  152. Markov Chains and Ergodic Theorems
  153. Countable Markov Chains
  154. Harris Markov Chains
  155. The Poisson Equation
  156. Markov Chains in Metric Spaces
  157. Existence and Uniqueness of Fixed Points for Markov Operators
  158. Existence and Uniqueness of Invariant Probability Measures
  159. Classification of Markov Chains via Occupation Measures
  160. Approximation Procedures for Invariant Probability Measures
  161. Solving Global Optimization Problems over Polynomials with GloptiPoly 2.1
  162. The Integer Hull of a Convex Rational Polytope
  163. A Discrete Farkas Lemma
  164. Solving the knapsack problem via -transform
  165. La valeur optimale des programmes entiers
  166. On the importance of sequencing decisions in production planning and scheduling
  167. Bounds on measures satisfying moment conditions
  168. Analytic perturbation of Sylvester matrix equations
  169. Semidefinite Programming vs. LP Relaxations for Polynomial Programming
  170. The Linear Programming Approach
  171. An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
  172. Mathematical Properties of Optimization Problems Defined by Positively Homogeneous Functions
  173. A Laplace transform algorithm for the volume of a convex polytope
  174. A Quick Proof for the Volume of n-Balls
  175. Pythagoras' Theorem for Areas
  176. chain
  177. The Multi-Dimensional Version of � b a x p dx
  178. On the probabilistic multichain Poisson equation
  179. Solving a class of multivariate integration problems via Laplace techniques
  180. New Positive Semidefinite Relaxations for Nonconvex Quadratic Programs
  181. An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
  182. Global Optimization with Polynomials and the Problem of Moments
  183. Optimisation globale et théorie des moments
  184. Why the logarithmic barrier function in convex and linear programming?
  185. Quasi-Feller Markov chains
  186. Zero-Sum Stochastic Games in Borel Spaces: Average Payoff Criteria
  187. Fatou's Lemma and Lebesgue's convergence theorem for measures
  188. The fundamental matrix of singularly perturbed Markov chains
  189. The fundamental matrix of singularly perturbed Markov chains
  190. Further Topics on Discrete-Time Markov Control Processes
  191. The Linear Programming Approach
  192. Discounted Dynamic Programming with Weighted Norms
  193. Undiscounted Cost Criteria
  194. The Expected Total Cost Criterion
  195. Sample Path Average Cost
  196. Ergodicity and Poisson’s Equation
  197. Planning and scheduling in a multi-site environment
  198. Sample-path average optimality for Markov control processes
  199. Approximation Schemes for Infinite Linear Programs
  200. A Lyapunov Criterion for Invariant Probabilities with Geometric Tail
  201. Multi-resource shop scheduling with resource flexibility
  202. Existence and Uniqueness of Fixed Points for Markov Operators and Markov Processes
  203. Lot Streaming in Job-Shop Scheduling
  204. Invariant probabilities for Markov chains on a metric space
  205. Tight bounds for the trace of a matrix product
  206. A Farkas lemma Without A Standard Closure Condition
  207. On the setwise convergence of sequences of measures
  208. Discrete-Time Markov Control Processes: Basic Optimality Criteria.
  209. Existence of bounded invariant probability densities for Markov chains
  210. Existence and uniqueness of an invariant probability for a class of Feller Markov chains
  211. Invariant Probabilities with Geometric Tail
  212. Discrete-Time Markov Control Processes
  213. Infinite-Horizon Discounted-Cost Problems
  214. The Linear Programming Formulation
  215. Long-Run Average-Cost Problems
  216. Introduction and Summary
  217. Markov Control Processes
  218. Finite-Horizon Problems
  219. Average Optimality in Markov Control Processes via Discounted-Cost Problems and Linear Programming
  220. Linear programming with positive semi-definite matrices
  221. A new Farkas lemma for positive semidefinite matrices
  222. Invariant probabilities for Feller-Markov chains
  223. A trace inequality for matrix product
  224. Detecting Optimal and Non-Optimal Actions in Average-Cost Markov Decision Processes
  225. A Formula for Singular Perturbations of Markov Chains
  226. Integration of lotsizing and scheduling decisions in a job-shop
  227. Weak conditions for average optimality in Markov control processes
  228. Average Optimal Stationary Policies and Linear Programming in Countable Space Markov Decision Processes
  229. Linear Programming and Average Optimality of Markov Control Processes on Borel Spaces—Unbounded Costs
  230. Linear programming formulation of MDPs in countable state space: The multichain case
  231. An Integrated Approach in Production Planning and Scheduling
  232. Various Resolution Strategies
  233. Lot Streaming
  234. Job-Shop Sequencing and Scheduling
  235. Extensions of the Model
  236. An Integrated Planning and Scheduling Model
  237. Production Planning and Scheduling
  238. An iterative procedure for lot streaming in job-shop scheduling
  239. Value Iteration and Rolling Plans for Markov Control Processes with Unbounded Rewards
  240. A modified shifting bottleneck procedure for job-shop scheduling
  241. Reachable, controllable sets and stabilizing control of constrained linear systems
  242. Preface
  243. Exact formula for sensitivity analysis of Markov chains
  244. Reachable and controllable sets for two-dimensional, linear, discrete-time systems
  245. Average cost Markov Decision Processes: Optimality conditions
  246. Robust hierarchical production planning under uncertainty
  247. Average cost optimal policies for Markov control processes with Borel state space and unbounded costs
  248. Denumerable state nonhomogeneous Markov decision processes
  249. Error bounds for rolling horizon policies in discrete-time Markov control processes
  250. Conditions for existence of average and Blackwell optimal stationary policies in denumerable Markov decision processes
  251. Existence of closed-loop policies for constrained discrete-time linear systems with bounded disturbances
  252. Strong 1-optimal stationary policies in denumerable Markov decision processes
  253. A forecast horizon and a stopping rule for general Markov decision processes
  254. A complete characterization of reachable sets for constrained linear time-varying systems
  255. Consistency of a linear system of inequalities
  256. Simulated annealing, random search, multistart or SAD?
  257. An on-line procedure in discounted infinite-horizon stochastic optimal control
  258. Consistency of a linear system of inequalities
  259. Detecting planning horizons in deterministic infinite horizon optimal control
  260. Measuring decision flexibility in production planning
  261. A mixed forward-backward dynamic programming method using parallel computation
  262. Infinite horizon nonstationary stochastic optimal control problem: A planning horizon result
  263. On the open-loop solution of linear stochastic optimal control problems
  264. Aggregate model and decomposition method for mid-term production planning
  265. An analytical expression and an algorithm for the volume of a convex polyhedron inR n
  266. A globally convergent algorithm for exact penalty functions
  267. A property of certain multistage linear programs and some applications
  268. Preface
  269. Global optimality certificates
  270. Parametric optimization
  271. Inverse polynomial optimization
  272. Semidefinite programming
  273. The GloptiPoly software
  274. References
  275. Introduction and message of the book
  276. Positive polynomials and moment problems
  277. Another look at nonnegativity
  278. The cone of polynomials nonnegative on K
  279. The primal and dual points of view
  280. Semidefinite relaxations for polynomial optimization
  281. Exploiting sparsity or symmetry
  282. Minimization of rational functions
  283. LP-relaxations for polynomial optimization
  284. Semidefinite relaxations for semi-algebraic optimization
  285. Polynomial optimization as an eigenvalue problem
  286. Convexity in polynomial optimization
  287. Convex underestimators of polynomials
  288. Approximation of sets defined with quantifiers
  289. Simple Explicit Formula for Counting Lattice Points of Polyhedra
  290. Level sets and a generalization of the Löwner–John problem
  291. Nonlinear optimal control: approximations via moments and LMI-relaxations
  292. SOS approximation of polynomials nonnegative on an algebraic set
  293. Analytic perturbation of Sylvester and Lyapunov matrix equations