首页/论文/2012.06553

arXiv 2012.065532020-12-11math.OC

A seven-point algorithm for piecewise smooth univariate minimization

Jonathan Grant-Peters, Raphael Hauser

英文摘要：

In this paper, we construct an algorithm for minimising piecewise smooth functions for which derivative information is not available. The algorithm constructs a pair of quadratic functions, one on each side of the point with smallest known function value, and selects the intersection of these quadratics as the next test point. This algorithm relies on the quadratic function underestimating the true function within a specific range, which is accomplished using a adjustment term that is modified as the algorithm progresses.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

非线性函数分段线性松弛的构建公式

Building Formulations for Piecewise Linear Relaxations of Nonlinear Functions

本研究针对可由广义n维有序组合析取约束建模的非线性函数，提出了更省二进制变量的单变量分段线性上下界同步建模技术，以及对数规模的理想非扩展公式，实验验证了其显著加速效果与强对偶界优势。

2023-04-27math.OC

On the piecewise-concave approximations of functions

The piecewise-concave function may be used to approximate a wide range of other functions to arbitrary precision over a bounded set. In this short paper, this property is proven for three function classes: (a) the multivariate twice continuously differentiable function, (b) the univariate Lipschitz-continuous function, and (c) the multivariate separable Lipschitz-continuous function.

2014-04-16math.OC

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions

We study MINLO (mixed-integer nonlinear optimization) formulations of the disjunction $x\in\{0\}\cup[\ell,u]$, where $z$ is a binary indicator of $x\in[\ell,u]$ ($0 \leq \ell <u$), and $y$ "captures" $f(x)$, which is assumed to be convex and positive on its domain $[\ell,u]$, but otherwise $y=0$ when $x=0$. This model is very useful in nonlinear combinatorial optimization, where there is a fixed cost of operating an activity at level $x$ in the operating range $[\ell,u]$, and then there is a further (convex) variable cost $f(x)$. In particular, we study relaxations related to the perspective t…

2020-09-15cs.OHmath.OC

Visualization of the ε-Subdifferential of Piecewise Linear-Quadratic Functions

Computing explicitly the ε-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting theoretical algorithm is applied to the the class of (convex univariate) piecewise linear-quadratic functions for which existing numerical libraries allow practical computations. We visualize the results in a primal, dual, and subdifferential views through several numerical examples. We also provide a visualization of the Brøndsted-Rockafellar Theorem.

2017-09-24math.OC

坐标方式多面体方法用于引出多元线性效用和单变量非线性效用函数

Coordinate-wise Polyhedral Method for Eliciting Multivariate Linear Utility and Univariate Nonlinear Utility Functions

School of Mathematics and Statistics, Xi’an Jiaotong University（西安交通大学数学与统计学院）；Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong（香港中文大学系统科学与工程学系）

提出坐标方式多面体方法（CPM），通过预定义坐标切割并求解线性方程组设计查询，实现线性收敛率，并扩展至单变量分段线性及一般Lipschitz连续效用函数。

2026-06-12math.OC

Computation of the Epsilon-Subdifferential of Convex Piecewise-Defined Functions in Optimal Worst-Case Time

The $ε$-subdifferential of convex univariate piecewise linear-quadratic functions can be computed in linear worst-case time complexity as the level-set of a convex function. Using dichotomic search, we show how the computation can be performed in logarithmic worst-case time. Furthermore, a new algorithm to compute the entire graph of the $ε$-subdifferential in linear time is presented. Both algorithms are not limited to convex PLQ functions but are also applicable to any convex piecewise-defined function with little restrictions.

2018-03-02math.OC

更多相关论文收起更多论文

Nonconvex piecewise linear functions: Advanced formulations and simple modeling tools

We present novel mixed-integer programming (MIP) formulations for optimization over nonconvex piecewise linear functions. We exploit recent advances in the systematic construction of MIP formulations to derive new formulations for univariate functions using a geometric approach, and for bivariate functions using a combinatorial approach. All formulations are strong, small (so-called logarithmic formulations), and have other desirable computational properties. We present extensive experiments in which they exhibit substantial computational performance improvements over existing approaches. To a…

2019-10-08math.OC

Sparse moments of univariate step functions and allele frequency spectra

We study the univariate moment problem of piecewise-constant density functions on the interval $[0,1]$ and its consequences for an inference problem in population genetics. We show that, up to closure, any collection of $n$ moments is achieved by a step function with at most $n-1$ breakpoints and that this bound is tight. We use this to show that any point in the $n$th coalescence manifold in population genetics can be attained by a piecewise constant population history with at most $n-2$ changes. Both the moment cones and the coalescence manifold are projected spectrahedra and we describe the…

2020-12-28math.AGmath.FAmath.OC

Merits of the Incremental Method for modeling Piecewise Linear functions

Several techniques were proposed to model the Piecewise linear (PWL) functions, including convex combination, incremental and multiple choice methods. Although the incremental method was proved to be very efficient, the attention of the authors in this field was drawn to the convex combination method, especially for discontinuous PWL functions. In this work, we modify the incremental method to make it suitable for discontinuous functions. The numerical results indicate that the modified incremental method could have considerable reduction in computational time, mainly due to the reduction in t…

2018-02-12math.OC

Comparing perspective reformulations for piecewise-convex optimization

Our study is motivated by the solution of Mixed-Integer Non-Linear Programming (MINLP) problems with separable non-convex functions via the Sequential Convex MINLP technique, an iterative method whose main characteristic is that of solving, for bounding purposes, piecewise-convex MINLP relaxations obtained by identifying the intervals in which each univariate function is convex or concave and then relaxing the concave parts with piecewise-linear relaxations of increasing precision. This process requires the introduction of new binary variables for the activation of the intervals where the func…

2022-11-28math.OC

具有最少分段数的最近一元凸线性二次函数逼近

Closest univariate convex linear-quadratic function approximation with minimal number of Pieces

University of British Columbia Okanagan（不列颠哥伦比亚大学奥肯那根分校）

本文提出一种两阶段算法，通过贪心搜索和二分搜索求解对数个优化问题，获得给定一元分段线性二次函数的最少分段数的最近凸逼近，并应用于道路竖曲线简化。

2026-09-18cs.CGmath.OC

关于在精度约束下逼近非线性函数所需的最小线性分段数

On the Minimum Number of Linear Pieces Required to Approximate Nonlinear Functions under an Accuracy Constraint

Trier University（特里尔大学）；Université de Toulouse, INP, LAAS-CNRS（图卢兹大学，国立高等理工学院，法国国家科学研究中心实验室）

本文研究走廊拟合问题，即在给定误差界限下用最少分段线性函数逼近非线性函数，提出基于定义域离散化的四种松弛方法，给出R^2实例的新上界和首个下界，解决超三分之一文献实例。

2026-09-25math.OC

利用约束光滑加性回归模型进行全局优化

On leveraging constrained smooth additive regression models for global optimization

Universidad Carlos III de Madrid（马德里卡洛斯三世大学）；École Polytechnique, Institut Polytechnique de Paris（巴黎高等理工学院，巴黎理工学院）

提出MISSOC算法，通过B样条光滑加性回归模型近似混合整数非线性规划中的复杂函数，并融入形状约束，构建数据与知识驱动的代理模型，以提升求解效率和质量。

2026-09-09math.OC