Results 31 to 40 of about 24,807 (199)
Sufficient optimality criteria and duality for multiobjective variational control problems with B-(p,r)-invex functions [PDF]
In this paper, we generalize the notion of \(B\)-\((p,r)\)-invexity introduced by Antczak in [A class of \(B\)-\((p; r)\)-invex functions and mathematical programming, J. Math. Anal. Appl. 286 (2003), 187-206] for scalar optimization problems to the case
Tadeusz Antczak, Manuel Arana Jiménez
doaj +1 more source
Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
The systematic design of exact optimal designs of experiments is typically challenging, as it results in nonconvex optimization problems. The literature on the computation of model-based exact optimal designs of experiments via mathematical programming ...
Belmiro P. M. Duarte
doaj +1 more source
An Accelerating Algorithm for Linear Multiplicative Programming Problem
By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP).
Shuai Tang, Zhisong Hou, Longquan Yong
doaj +1 more source
Deep Learning‐Assisted Design of Mechanical Metamaterials
This review examines the role of data‐driven deep learning methodologies in advancing mechanical metamaterial design, focusing on the specific methodologies, applications, challenges, and outlooks of this field. Mechanical metamaterials (MMs), characterized by their extraordinary mechanical behaviors derived from architected microstructures, have ...
Zisheng Zong +5 more
wiley +1 more source
Combined heat and power dynamic economic emission dispatch (CHPDEED) problem is a complicated nonlinear constrained multiobjective optimization problem with nonconvex characteristics.
A. M. Elaiw, X. Xia, A. M. Shehata
doaj +1 more source
An ADMM-based SQP method for separably smooth nonconvex optimization
This work is about a splitting approach for solving separably smooth nonconvex linearly constrained optimization problems. Based on the ideas from two classical methods, namely the sequential quadratic programming (SQP) and the alternating direction ...
Meixing Liu, Jinbao Jian
doaj +1 more source
A physics‐guided machine learning framework estimates Young's modulus in multilayered multimaterial hyperelastic cylinders using contact mechanics. A semiempirical stiffness law is embedded into a custom neural network, ensuring physically consistent predictions. Validation against experimental and numerical data on C.
Christoforos Rekatsinas +4 more
wiley +1 more source
This paper introduces constructing convex-relaxed programs for nonconvex optimization problems. Branch-and-bound algorithms are convex-relaxation-based techniques.
Keller André A.
doaj +1 more source
A Status Report on Conflict Analysis in Mixed Integer Nonlinear Programming
Mixed integer nonlinear programs (MINLPs) are arguably among the hardest optimization problems, with a wide range of applications. MINLP solvers that are based on linear relaxations and spatial branching work similar as mixed integer programming (MIP ...
A Forsgren +37 more
core +1 more source
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

