Results 111 to 120 of about 1,804,722 (202)
Surrogate Scattering Matrix‐Guided Inverse Design of Nanophotonic Neural Networks
Surrogate‐guided inverse design separates task learning from electromagnetic realization by transferring a trained passive operator to a fabrication‐aware nanophotonic structure. The electromagnetic cost of each update depends on port count rather than the dataset size.
Azka Maula Iskandar Muda, Uğur Teğin
wiley +1 more source
Microring Resonator Dispersion Metrology With Neural Networks
We present a machine learning framework for inverse and forward characterization of microring resonators, inferring geometry and material dispersion from sparse spectral data. The approach achieves nanometer‐scale accuracy and > 99% material identification, while reconstructing full dispersion spectra.
Ergun Simsek +3 more
wiley +1 more source
On the Solution of a Nonconvex Fractional Quadratic Problem
In this paper, we give an algorithm for solving a class of nonconvex quadratic fractional problems that may arise during a correction of inconsistent set of linear inequalities.
S. Ketabchi +2 more
doaj
An agentic AI‐driven decision‐support framework for prosumers is proposed, integrating PV generation, load profiling, and multihorizon optimization within a four‐agent architecture. The approach significantly reduces grid dependence, enhances self‐sufficiency and prevents system oversizing.
Adela BÂRA, Simona‐Vasilica OPREA
wiley +1 more source
Weak Conjugate Duality for Nonconvex Vector Optimization
WOS: 000395355900006In this work, weak conjugate map, weak biconjugate map and weak subdifferential of a set-valued map are defined by using notions of supremum/infimum of a set and vectorial norm, and relationships among these notions are examined ...
Küçük, Mahide +2 more
core
Exact Penalty Algorithm of Strong Convertible Nonconvex Optimization
This paper defines a strong convertible nonconvex(SCN) function for solving the unconstrained optimization problems with the nonconvex or nonsmooth(nondifferentiable) function.
Shen, Rui +3 more
core +1 more source
This paper proposes a new proximal iteratively reweighted nuclear norm method for a class of nonconvex and nonsmooth optimization problems. The primary contribution of this work is the incorporation of line search technique based on dimensionality ...
Zhili Ge, Siyu Zhang, Xin Zhang, Yan Cui
doaj +1 more source
Robust Representation Learning for Clean Feature Discovery in Incomplete Multi‐View Clustering
Robust feature discovery in incomplete multi‐view clustering is achieved by coupling RPCA‐based clean representation recovery with neural‐network‐assisted graph learning. The resulting RIMVC framework constructs cleaner and more discriminative graph‐structured representations from incomplete and noisy multi‐view data, improving clustering robustness ...
Ping Hu +4 more
wiley +1 more source
The Complexity of Optimizing over a Simplex, Hypercube or Sphere: A Short Survey [PDF]
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as ...
Klerk, E. de
core
NONCONVEX PHASE SYNCHRONIZATION
We estimate n phases (angles) from noisy pairwise relative phase measurements. The task is modeled as a nonconvex least-squares optimization problem. It was recently shown that this problem can be solved in polynomial time via convex relaxation, under ...
Boumal, Nicolas
core +1 more source

