Bauer's Maximum Principle for Quasiconvex Functions
This note shows that in Bauer's maximum principle, the assumed convexity of the objective function can be relaxed to quasiconvexity.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
GegenbauerNet: Finding the Optimal Compromise in the GNN Flexibility-Stability Trade-off
Spectral Graph Neural Networks (GNNs) operating in the canonical [-1, 1] domain (like ChebyNet and its adaptive generalization, L-JacobiNet) face a fundamental Flexibility-Stability Trade-off. Our previous work revealed …
Random Gegenbauer Features for Scalable Kernel Methods
We propose efficient random features for approximating a new and rich class of kernel functions that we refer to as Generalized Zonal Kernels (GZK). Our proposed GZK family, generalizes the zonal kernels (i.e., dot-produ…
Dual representations of quasiconvex compositions with applications to systemic risk
Motivated by the problem of finding dual representations for quasiconvex systemic risk measures in financial mathematics, we study quasiconvex compositions in an abstract infinite-dimensional setting. We calculate an exp…
Line Search for Convex Minimization
Golden-section search and bisection search are the two main principled algorithms for 1d minimization of quasiconvex (unimodal) functions. The first one only uses function queries, while the second one also uses gradient…
Bauer's Spectral Factorization Method for Low Order Multiwavelet Filter Design
Para-Hermitian polynomial matrices obtained by matrix spectral factorization lead to functions useful in control theory systems, basis functions in numerical methods or multiscaling functions used in signal processing. W…