Results 151 to 160 of about 2,345,368 (345)

Nonlinear complementarity . . . constrained minimization [PDF]

open access: yes, 1993
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtained from an augmented Lagrangian formulation. The dimensionality of the unconstrained problem is the same as that of the original problem, and the penalty
O. L. Mangasarian, M. V. Solodov
core  

The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems

open access: yesAbstract and Applied Analysis, 2014
We introduced an implicit and an explicit iteration method based on the hybrid steepest descent method for finding a common element of the set of solutions of a constrained convex minimization problem and the set of solutions of a split variational ...
Jitsupa Deepho, Poom Kumam
doaj   +1 more source

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

open access: yesAdvanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

Ontology‐Aligned Structuring and Reuse of Multimodal Materials Data and Workflows Toward Automatic Reproduction

open access: yesAdvanced Engineering Materials, EarlyView.
Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari   +5 more
wiley   +1 more source

Iterative gradient methods for constrained minimization [PDF]

open access: yes, 2013
In this paper we deal with the problem of minimizing a strongly convex objective function over the set of fixed points of a nonexpansive mapping T. This extends the constrained strongly convex minimization problem over a closed convex subset C of a ...
Hsu, Han-Ting
core  

Soft Mechanical‐Electrical Logic Using Liquid Metal‐Filled 3D‐Printed Architectures

open access: yesAdvanced Engineering Materials, EarlyView.
We present 3D‐printed soft mechanical–electrical logic elements that use liquid metal–filled silicone tubes actuated by thermoplastic polyurethane/polylactic acid (TPU/PLA) architectures to produce Boolean operations. Complementary normally open and normally closed unit cells perform repeatable binary transitions and can be combined into more complex ...
Christoph Lehmann   +2 more
wiley   +1 more source

On Constrained Mixed-Integer DR-Submodular Minimization

open access: yesMathematics of Operations Research
Diminishing returns (DR)–submodular functions encompass a broad class of functions that are generally nonconvex and nonconcave. We study the problem of minimizing any DR-submodular function with continuous and general integer variables under box constraints and, possibly, additional monotonicity constraints.
Qimeng Yu, Simge Küçükyavuz
openaire   +3 more sources

Modeling Dislocation Cutting of γ′ Precipitates in Ni‐Base Superalloys: Linking Atomistic and Dislocation Dynamics Simulations

open access: yesAdvanced Engineering Materials, EarlyView.
Dislocation cutting of γ′ precipitates in Ni‐based superalloys is investigated by linking atomistic simulations with discrete dislocation dynamics. The critical cutting stress is shown to be governed by the antiphase boundary energy, while line tension effects promote edge‐preferred cutting.
Frédéric Houllé   +9 more
wiley   +1 more source

Hidden Convexity in Partially Separable Optimization [PDF]

open access: yes
The paper identifies classes of nonconvex optimization problems whose convex relaxations have optimal solutions which at the same time are global optimal solutions of the original nonconvex problems. Such a hidden convexity property was so far limited to
Laurent, M., Ben-Tal, A., Hertog, D. den
core   +1 more source

Home - About - Disclaimer - Privacy