Results 201 to 210 of about 13,821 (242)
Ground truth clustering is not the optimum clustering. [PDF]
Sci RepBautista LA, Hrga T, Povh J, Zhao S.
europepmc +1 more source
Hybrid nanofluid-based targeted drug delivery system for tumor therapy under magnetic and thermal control. [PDF]
Sci RepZar PM, Zar VM.
europepmc +1 more source
Integrating physical units into high-performance AI-driven scientific computing. [PDF]
Nat CommunWang C, He S, Luo S, Huan Y, Wu S.
europepmc +1 more source
Mathematical Modeling of Population Dynamics of Pollinators: A Survey. [PDF]
Biology (Basel)Huancas F +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A discrete numerical method for brittle rocks using mathematical programming
Acta Geotechnica, 2017A computational formulation of discrete simulations of damage and failure in brittle rocks using mathematical programming methods is proposed. The variational formulations are developed in two and three dimensions. These formulations naturally lead to second-order cone programs and can conveniently be solved using off-the-shelf mathematical programming
Meng, J., Huang, J., Yao, C., Sheng, D.
openaire +1 more source
Informatization and communication, 2020
The problems of analysis and planning of diversified production, including the lack of effective methods for search, systematization and primary processing of initial data for mathematical programming methods used in the process of its optimization are considered. Methodology IDEF0 is proposed as a data collection system.
I.I. Kovtun, G.S. Romanenko
openaire +1 more source
The problems of analysis and planning of diversified production, including the lack of effective methods for search, systematization and primary processing of initial data for mathematical programming methods used in the process of its optimization are considered. Methodology IDEF0 is proposed as a data collection system.
I.I. Kovtun, G.S. Romanenko
openaire +1 more source
Numerical study of some feasible direction methods in mathematical programming
Journal of Optimization Theory and Applications, 1983Some feasible direction methods for the minimization of a linearly constrained convex function are studied. Special emphasis is placed on the analysis of the procedures which find the search direction, by developing active set methods which use orthogonal or Gauss-Jordan-like transformations.
Arioli M., Laratta A., Menchi O.
openaire +4 more sources
Mathematical Programming, 2011
The authors deal with convergence properties of five relaxation methods for solving mathematical programs with equilibrium constraints (MPECs). Several existed convergence results are improved and some new results regarding the satisfaction of standard constraint qualifications for the relaxed problems are obtained.
Hoheisel, Tim +2 more
openaire +1 more source
The authors deal with convergence properties of five relaxation methods for solving mathematical programs with equilibrium constraints (MPECs). Several existed convergence results are improved and some new results regarding the satisfaction of standard constraint qualifications for the relaxed problems are obtained.
Hoheisel, Tim +2 more
openaire +1 more source