Results 121 to 130 of about 679,367 (185)
Enhanced adaptive zebra optimization algorithm optimized kernel extreme learning machine for bankruptcy prediction problems. [PDF]
Liu W, Zhang Y, Du M.
europepmc +1 more source
Transformable Quadruped Wheelchair: Unified Walking and Wheeled Locomotion via Mode-Conditioned Policy Distillation. [PDF]
Akamisaka A, Nagao K.
europepmc +1 more source
Method for predicting dynamic current-carrying capacity of transmission lines by integrating improved VMD and time-varying ensemble model. [PDF]
Yang S, Hao W.
europepmc +1 more source
Redundancy-as-masking: formalizing the Artificial Age Score (AAS) to model memory aging in generative AI. [PDF]
Kayadibi SY.
europepmc +1 more source
NaviDiv: a web app for monitoring chemical diversity in generative molecular design.
Azzouzi M, Worakul T, Corminboeuf C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Penalty functions with a small penalty parameter
Optimization Methods and Software, 2002In this article, we study the nonlinear penalization of a constrained optimization problem and show that the least exact penalty parameter of an equivalent parametric optimization problem can be diminished. We apply the theory of increasing positively homogeneous (IPH) functions so as to derive a simple formula for computing the least exact penalty ...
A.M. Rubinov, X.Q. Yang, A.M. Bagirov
openaire +1 more source
Linearization and Penalty Functions
Cybernetics and Systems Analysis, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
SIAM Journal on Optimization, 2003
A new approach to exact penalization of a constrained, nonlinear optimization problem is introduced. This is motivated by the desire to deal with the following list of perceived failures of other exact penalty methods: 1. nonsmoothness is avoided; 2. the penalized objective remains bounded below under mild assumptions; 3.
Huyer, Waltraud, Neumaier, Arnold
openaire +2 more sources
A new approach to exact penalization of a constrained, nonlinear optimization problem is introduced. This is motivated by the desire to deal with the following list of perceived failures of other exact penalty methods: 1. nonsmoothness is avoided; 2. the penalized objective remains bounded below under mild assumptions; 3.
Huyer, Waltraud, Neumaier, Arnold
openaire +2 more sources

