Search Results - convex functions AND convex progress in convex geometry

Convex Primal Formulations for Convex Hull Pricing With Reserve Commitments by Yu, Yanan, Zhang, Tong, Guan, Yongpei, Chen, Yonghong

“…Convex hull pricing has been introduced recently to increase transparency and reduce uplift payments for the U.S. wholesale markets…”
Get full text

Superfast Second-Order Methods for Unconstrained Convex Optimization by Nesterov, Yurii

“…; Arjevani and Shiff in Math Program 178(1–2):327–360, 2019), which is O k - 7 / 2 . Our progress can be explained by a finer specification of the problem class…”
Get full text

Linearization and parallelization schemes for convex mixed-integer nonlinear optimization by Sharma, Meenarli, Palkar, Prashant, Mahajan, Ashutosh

“…We develop and test linearization and parallelization schemes for convex mixed-integer nonlinear programming…”
Get full text

The Largest Eigenvalue of a Convex Function, Duality, and a Theorem of Slodkowski by Dellatorre, Matthew

“…” of a convex function. In his work on the Dirichlet problem, Slodkowski introduces a generalized second-order derivative which for C 2 functions corresponds to the largest eigenvalue of the Hessian…”
Get full text

Convergence analysis of a proximal point algorithm for minimizing differences of functions by An, Nguyen Thai, Nam, Nguyen Mau

“… A significant progress to go beyond convexity was made by considering the class of functions representable as differences of convex functions…”
Get full text

The joy of implications, aka pure Horn formulas: Mainly a survey by Wild, Marcel

“… We survey the mathematical theory of implications with an emphasis on the progress made in the last 30 years…”
Get full text

Fredholm Eigenvalues and Quasiconformal Geometry of Polygons by Krushkal, Samuel L.

“… This is important also for the potential theory but has not been solved even for convex polygons. This case has intrinsic interest in view of the connection of polygons with the geometry of the universal…”
Get full text

On the Convergence of a Bayesian Algorithm for Joint Dictionary Learning and Sparse Recovery by Joseph, Geethu, Murthy, Chandra R.

“… In this paper, we make progress on this problem by analyzing a Bayesian algorithm for DL. Specifically, we cast the DL problem into the sparse Bayesian learning (SBL…”
Get full text

On FISTA with a relative error rule by Bello-Cruz, Yunier, Gonçalves, Max L. N., Krislock, Nathan

“…The fast iterative shrinkage/thresholding algorithm (FISTA) is one of the most popular first-order iterations for minimizing the sum of two convex functions…”
Get full text

Recent Progress on Integrally Convex Functions by Murota, Kazuo, Tamura, Akihisa

“…Integrally convex functions constitute a fundamental function class in discrete convex analysis, including M-convex functions, L-convex functions, and many others…”
Get full text

Fast algorithms for maximizing monotone nonsubmodular functions by Liu, Bin, Hu, Miaomiao

“…) objective functions, the approximation algorithms for this problem have gotten much progress by using some interesting techniques…”
Get full text

Proximal point algorithms involving fixed points of nonexpansive mappings in CAT(0) spaces by Cholamjiak, Prasit, Abdou, Afrah AN, Cho, Yeol Je

“… ) spaces and prove that the sequence generated by our iterative process converges to a minimizer of a convex function and a fixed point of mappings…”
Get full text

Complex hyperbolic orbifolds and hybrid lattices by Falbel, Elisha, Pasquinelli, Irene

“…A class of complex hyperbolic lattices in PU (2, 1) called the Deligne-Mostow lattices has been reinterpreted by Hirzebruch (see [ 1 , 10 ] and [ 24 ]) in…”
Get full text

A non-monotone trust-region method with noisy oracles and additional sampling by Krejić, Nataša, Krklec Jerinkić, Nataša, Martínez, Ángeles, Yousefi, Mahsa

“… Depending on the estimated progress of the algorithm, this can yield sample size scenarios ranging from mini-batch to full sample functions…”
Get full text

An Algebraic Brascamp–Lieb Inequality by Duncan, Jennifer

“…–Lieb inequality is defined as a multilinear Lebesgue bound on the product of the pullbacks of a collection of functions f j ∈ L q j ( R n j ) , for j = 1…”
Get full text

Improved Weighted Restriction Estimates in R3 by Shayya, Bassam

“…Suppose 0 < α ≤ n , H : R n → [ 0 , 1 ] is a Lebesgue measurable function, and A α ( H ) is the infimum of all numbers C for which the…”
Get full text

Proximal Methods for Self-Healing and Exact Distributed Convex Optimization Extended abstract by Freeman, Randy A.

“…Distributed convex optimization algorithms employ a variety of methods for achieving exact convergence to the global optimal value…”
Get full text

Streaming submodular maximization under d-knapsack constraints by Chen, Zihan, Liu, Bin, Du, Hongmin W.

“… Among the known results, most of the submodular functions are defined on set. But recently some progress has been made on the integer lattice…”
Get full text

A Distributed Optimization Accelerated Algorithm with Uncoordinated Time-Varying Step-Sizes in an Undirected Network by Lü, Yunshan, Xiong, Hailing, Zhou, Hao, Guan, Xin

“…In recent years, significant progress has been made in the field of distributed optimization algorithms…”
Get full text

NISQ Hardness and Convex Relaxations: Random Max-CSPs and Mean-Field Spin Glasses by Sandhu, Juspreet Singh

“… If true, it implies optimal inapproximability results for every Max-CSP. Despite impressive recent progress towards the conjecture there are no candidate instances…”
Get full text