A Convex Maximization Problem: Discrete Case
Steven Finch
Abstract
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with interesting patterns arise in the analysis, owing to the number theoretic origin of the problem.
Create a lesson
Related papers
UGM: A Unified Framework and New Perspectives for Accelerated Gradient Methods in Smooth and Strongly Convex Optimization
Danqing Zhou, Shiqian Ma, Junfeng Yang
When MILP Beats QP: Piecewise-Linear Reformulations of Sequentially Coupled Bilinear Programs
Quentin Ploussard, Maris Usis, Oluwabunmi Iwakin et al.
Marine Autonomous Vehicle Fleet Scheduling to Maximise Scientific Impact
Mehdi El Krari, Jonathan Smith, Maria Fox
Asymptotic consensus and flocking under decaying persistent excitation on rooted digraphs
Chiara Cicolani, Elisa Continelli, Cristina Pignotti
Co-Optimized Generation, Transmission, and Storage Expansion: System Value and Optimal Duration of Pumped-Storage Hydropower
Rafael Benchimol Klausner, Rafael Kelman
Randomized Quasi-Gauss--Newton Methods for Solving General Nonlinear Equations
Chengchang Liu, Luo Luo