Results 141 to 150 of about 12,325 (304)
Progressively Projected Newton's Method
Abstract Newton's Method is widely used to find the solution of complex non‐linear simulation problems. To guarantee a descent direction, it is common practice to clamp the negative eigenvalues of each element Hessian prior to assembly—a strategy known as Projected Newton (PN)—but this perturbation often hinders convergence.
J. A. Fernández‐Fernández +2 more
wiley +1 more source
Convex sets, convex cones, affine spaces and affine cones
After introducing the concepts of a convex set, an affine space resp. a convex cone as subcases and last not least an affine cone as common subsubcase in an axiomatic manner by requiring the closedness against corresponding combination maps the author considers maps \(f:X\to Y\) between such sets \(X,Y\). He defines a map \(f\) between convex sets as a
openaire +2 more sources
Embedding Optimization of Layouts via Distortion Minimization
Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley +1 more source
Abstract We present a morphology‐based backbone phylogeny of Cerambycidae beetles inferred by parsimony analyses using 77 adult characters scored for 101 species. This phylogeny is largely consistent with recent phylogenomic studies regarding key placements (e.g., Parandrini stat. rev. within Prioninae, Necydalini stat. rev.
Burcu Şabanoğlu Şimşek +2 more
wiley +1 more source
Convex Operators in Vector Optimization: Directional Derivatives and the Cone of Decrease Directions
The paper is devoted to the investigation of directional derivatives and the cone of decrease directions for convex operators on Banach spaces. We prove a condition for the existence of directional derivatives which does not assume regularity of the ...
Matthias Ehrgott +3 more
core
Computing the recession cone of a convex upper image via convex projection
It is possible to solve unbounded convex vector optimization problems (CVOPs) in two phases: (1) computing or approximating the recession cone of the upper image and (2) solving the equivalent bounded CVOP where the ordering cone is extended based on the
Ulus, Firdevs +2 more
core +1 more source
Generalized Legendre Transforms Have Roots in Information Geometry. [PDF]
Nielsen F.
europepmc +1 more source
ABSTRACT Background Modern higher education requires a redefinition of pedagogical objectives to meet the evolving cognitive and perceptual demands of contemporary students. One such emerging objective is the cultivation of visual perceptions. Generational differences suggest that current students possess distinct cognitive profiles and learning ...
Adrienne Fazekas +7 more
wiley +1 more source
Programming Nonlinear Interfacial Mechanics of Synthetic Cells: Lipid Geometry and DNA Nanostructures. [PDF]
Masuda K, Yanagisawa M.
europepmc +1 more source

