Results 131 to 140 of about 619,204 (327)
Convex optimization for maximizing the degradation efficiency of chloroquine in a flow-by electrochemical reactor. [PDF]
J Solid State Electrochem, 2023 Regalado-Méndez A +3 more
europepmc +1 more source
Inverse Optimization of Convex Risk Functions
, 2016 The theory of convex risk functions has now been well established as the basis for identifying the families of risk functions that should be used in risk averse optimization problems.
Li, Jonathan Yu-Meng
core
Convex optimization of contour deformations
Physical Review DWe discuss various formal aspects of contour deformations used to alleviate sign problems; most importantly, relating these contour deformations to a certain convex optimization problem. As a consequence of this connection we describe a general method for proving upper bounds on the average phase achievable by the contour deformation method. Using this
Scott Lawrence, Yukari Yamauchi
openaire +2 more sources
Advanced Optical Materials, EarlyView.Lowering the barrier for researchers to explore polariton physics: A fully solution‐processed dielectric polariton microcavity incorporating Rhodamine 6G with tunable Rabi splitting up to 400 meV and photoluminescence. Abstract Planar microcavity polaritons have recently emerged as a promising technology for improving several performance ...
Hassan A. Qureshi +7 more
wiley +1 more source
A Convex Optimization Approach to Multi-Robot Task Allocation and Path Planning. [PDF]
Sensors (Basel), 2023 Lei T, Chintam P, Luo C, Liu L, Jan GE.
europepmc +1 more source
Mathematics, 2018 This paper deals with robust quasi approximate optimal solutions for a nonsmooth semi-infinite optimization problems with uncertainty data. By virtue of the epigraphs of the conjugates of the constraint functions, we first introduce a robust type closed ...
Xiangkai Sun, Hongyong Fu, Jing Zeng
doaj +1 more source
Non-Convex Distributed Optimization
, 2016 We study distributed non-convex optimization on a time-varying multi-agent network. Each node has access to its own smooth local cost function, and the collective goal is to minimize the sum of these functions.
Tatarenko, Tatiana, Touri, Behrouz
core
On the connections between algorithmic regularization and penalization for convex losses [PDF]
arXiv, 2019 In this work we establish the equivalence of algorithmic regularization and explicit convex penalization for generic convex losses. We introduce a geometric condition for the optimization path of a convex function, and show that if such a condition is satisfied, the optimization path of an iterative algorithm on the unregularized optimization problem ...
arxiv
Photochromic Organic–Inorganic Material for Focusable Adaptive Lenses Fabrication
Advanced Photonics Research, EarlyView.This study investigates a zirconia‐based hybrid organic–inorganic material incorporating dithienylethene molecules for adaptive optics. It offers excellent photochromic properties, thermal stability, and adjustable thickness, enabling effective refractive index modulation.
Giorgia Franchin +6 more
wiley +1 more source
Disciplined Geodesically Convex Programming [PDF]
arXivConvex programming plays a fundamental role in machine learning, data science, and engineering. Testing convexity structure in nonlinear programs relies on verifying the convexity of objectives and constraints. \citet{grant2006disciplined} introduced a framework, Disciplined Convex Programming (DCP), for automating this verification task for a wide ...
arxiv