Linear-Time Convexity Test for Low-Order Piecewise Polynomials
From MaRDI portal
Publication:5857296
DOI10.1137/19M1290851zbMath1477.26023OpenAlexW3139385714MaRDI QIDQ5857296
Publication date: 31 March 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1290851
optimizationconvex constraintspiecewise linear-quadratic functionsconvexity testpiecewise cubic functionsdifference definite
Convex programming (90C25) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41) Convexity of real functions of several variables, generalizations (26B25)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive, anisotropic and hierarchical cones of discrete convex functions
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Convex parametric piecewise quadratic optimization: theory and algorithms
- An iterated projection approach to variational problems under generalized convexity constraints
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- The piecewise linear-quadratic model for computational convex analysis
- On Newton's problem of minimal resistance
- On the structure of convex piecewise quadratic functions
- Faster than the fast Legendre transform, the linear-time Legendre transform
- A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions
- Conforming approximation of convex functions with the finite element method
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Two problems in economics
- The minimum of quadratic functionals of the gradient on the set of convex functions
- A technique to derive the analytical form of convex envelopes for some bivariate functions
- An algorithm for computing solutions of variational problems with global convexity constraints
- Cubic regularization of Newton method and its global performance
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
- Regularity of solutions for some variational problems subject to a convexity constraint
- H1-projection into the set of convex functions : a saddle-point formulation
- NON-CONVERGENCE RESULT FOR CONFORMAL APPROXIMATION OF VARIATIONAL PROBLEMS SUBJECT TO A CONVEXITY CONSTRAINT
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
- Sparse/Robust Estimation and Kalman Smoothing with Nonsmooth Log-Concave Densities: Modeling, Computation, and Theory
- On the convexity of piecewise-defined functions
- Noncoincidence of Approximate and Limiting Subdifferentials of Integral Functionals
- What Shape Is Your Conjugate? A Survey of Computational Convex Analysis and Its Applications
- Variational Analysis
- A Numerical Method for Variational Problems with Convexity Constraints
- Handling Convexity-Like Constraints in Variational Problems
- Characterizing and Testing Subdifferential Regularity in Piecewise Smooth Optimization
- Minimizing within Convex Bodies Using a Convex Hull Method
- Global optimization based on local searches
