Results 71 to 80 of about 691,952 (302)
Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization
AlgorithmsIn this work, we consider the problem of minimizing a quasi-convex function over a nonempty closed convex constrained set. In order to approximate a solution of the considered problem, we propose delayed star subgradient methods.
Ontima Pankoon, Nimit Nimana
doaj +1 more source
On a subclass of quasi-convex mappings
Journal of Mathematical Analysis and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Qing-Hua, Liu, Tai-Shun
openaire +1 more source
Uniform approximation by quasi-convex and convex functions
, 1988 Given a bounded function f defined on a convex subset of Rn, the two problems considered are to find a quasi-convex (convex) function which is a best approximation to f under the uniform norm.
Ubhaya, Vasant A
core +1 more source
Advanced Intelligent Discovery, EarlyView.This article outlines how artificial intelligence could reshape the design of next‐generation transistors as traditional scaling reaches its limits. It discusses emerging roles of machine learning across materials selection, device modeling, and fabrication processes, and highlights hierarchical reinforcement learning as a promising framework for ...
Shoubhanik Nath +4 more
wiley +1 more source
Geodesics on lorentzian manifolds with quasi-convex boundary
Manuscripta Mathematica, 1993 The paper is devoted to existence and multiplicity results on nonspatial geodesics joining two given events in warped product Lorentzian manifolds of the form \(M\times(a,b)\). The hypothesis contains a boundary convexity condition and a large class of some rather technical assumptions.
MASIELLO, Antonio, GIANNONI F.
openaire +4 more sources
, 2009 In this paper, we study the Hadamard’s inequality for midconvex and quasi-midconvex functions in topological groups.
Morassaei, Ali
core
Optimizing 3D Bin Packing of Heterogeneous Objects Using Continuous Transformations in SE(3)
Advanced Intelligent Systems, EarlyView.This article presents a method for solving the three‐dimensional bin packing problem for heterogeneous objects using continuous rigid‐body transformations in SE(3). A heuristic optimization framework combines signed‐distance functions, neural network approximations, point‐cloud bin modeling, and physics simulation to ensure feasibility and stability ...
Michele Angelini, Marco Carricato
wiley +1 more source
Locally Quasi-Convex Compatible Topologies on a Topological Group
Axioms, 2015 For a locally quasi-convex topological abelian group (G,τ), we study the poset \(\mathscr{C}(G,τ)\) of all locally quasi-convex topologies on (G) that are compatible with (τ) (i.e., have the same dual as (G,τ) ordered by inclusion.
Lydia Außenhofer +2 more
doaj +1 more source
On Mixed-Integer Random Convex Programs [PDF]
, 2012 We consider a class of mixed-integer optimization problems subject to N randomly drawn convex constraints. We provide explicit bounds on the tails of the probability that the optimal solution found under these N constraints will become infeasible for the
D. Lyons +8 more
core +1 more source
Advanced Intelligent Systems, EarlyView.HTFC gets 3D refractive index tomograms of flowing cells. Label‐free monocytes are engineered to express patterns of cytoplasmic vacuoles. From the tomogram, an efficient dimensionality reduction is operated. Interpretable features are extracted to classify the expression severity of phenotypes coexisting in each cell, visually represented by a seven ...
Marika Valentino +9 more
wiley +1 more source