Automatic decrease of the penalty parameter in exact penalty function methods [PDF]
European Journal of Operational Research, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mongeau, Marcel, Sartenaer, Annick
openaire +6 more sources
Exact Penalty Functions for Nonlinear Integer Programming Problems [PDF]
Journal of Optimization Theory and Applications, 2010 The authors first find a set of sufficient conditions under which the nonlinear problem \(\min \{ f(x) \, : \, x\in W \}\) has the same minimum point(s) as each member of the family \(\min \{ f(x)+\phi (x, \varepsilon) \, : \, x\in X ...
LUCIDI, Stefano, RINALDI, FRANCESCO
openaire +5 more sources
Design and Application of Intelligence Algorithms in Continuous Fermentation of Glycerol
IEEE Access, 2021 The bioconversion of 1,3-propanediol from glycerol by Klebsiella pneumoniae can be described by a nonlinear dynamic system. Some work has been done on the identification and optimization of the system, in which the dilution rate of glycerol is considered
Guoli Wu, Juan Wang, Zongli Ruan
doaj +1 more source
On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints [PDF]
Yugoslav Journal of Operations Research, 2019 In this paper, we considered the mathematical programs with vanishing constraints or MPVC. We proved that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification.
Nath Triloki, Khare Abeka
doaj +1 more source
Smooth exact penalty functions II: a reduction to standard exact penalty functions [PDF]
Optimization Letters, 2015 A new class of smooth exact penalty functions was recently introduced by Huyer and Neumaier. In this paper, we prove that the new smooth penalty function for a constrained optimization problem is exact if and only if the standard nonsmooth penalty function for this problem is exact.
openaire +2 more sources
A Lagrangian penalty function method for monotone variational inequalities [PDF]
, 1989 A Lagrange-type penalty function method is proposed for a class of variational inequalities. The penalty function may have both positive and negative values. Each penalized subproblem is required to be solved only approximately. A condition under which a
Muu, Lê D., Oettli, Werner
core +2 more sources
Smoothing of the lower-order exact penalty function for inequality constrained optimization
Journal of Inequalities and Applications, 2016 In this paper, we propose a method to smooth the general lower-order exact penalty function for inequality constrained optimization. We prove that an approximation global solution of the original problem can be obtained by searching a global solution of ...
Shujun Lian, Yaqiong Duan
doaj +1 more source
Optimal Diffusion Learning Over Networks—Part II: Multitask Algorithms
IEEE Open Journal of Signal Processing, 2022 In Part I of this presentation, we have formulated single and multitask quadratic optimization problems, where agents are subject to quadratic, smoothing constraints over a graph.
Ricardo Merched
doaj +1 more source
Известия Иркутского государственного университета: Серия "Математика", 2020 Generalized Nash Equilibrium Problems (GNEP) have been attracted by many researchers in the field of game theory, operational research, engineering, economics as well as telecommunication in recent two decades.
L. Altangerel, G. Battur
doaj +1 more source
Formulations and Approximations of Branch Flow Model for General Power Networks
Journal of Modern Power Systems and Clean Energy, 2022 The formulations and approximations of the branch flow model for general (radial and mesh) power networks (General-BranchFlow) are given in this paper.
Zhao Yuan
doaj +1 more source