Results 71 to 80 of about 1,433 (143)

On constrained set-valued optimization [PDF]

open access: yes
The set-valued optimization problem minC F(x), G(x)\(-K) 6= ; is considered, where F : Rn Rm and G : Rn Rp are set-valued functions, and C Rm and K Rp are closed convex cones.
Ginchev Ivan, Rocca Matteo
core  

On the multiplier rules

open access: yes, 2014
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form of Karush-Kuhn-
Blot, Joël
core   +1 more source

A Non-Monotone Conjugate Subgradient Type Method for Minimization of Convex Functions

open access: yes, 2019
We suggest a conjugate subgradient type method without any line-search for minimization of convex non differentiable functions. Unlike the custom methods of this class, it does not require monotone decrease of the goal function and reduces the ...
Konnov, Igor
core  

On ε-optimality conditions for multiobjective fractional optimization problems

open access: yesFixed Point Theory and Applications, 2011
A multiobjective fractional optimization problem (MFP), which consists of more than two fractional objective functions with convex numerator functions and convex denominator functions, finitely many convex constraint functions, and a geometric constraint
Kim Gwi, Lee Gue, Kim Moon
doaj  

A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting. [PDF]

open access: yesNumer Algorithms, 2023
Aragón-Artacho FJ   +2 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy