Results 41 to 50 of about 516 (82)

Characterizations of minimal elements of upper support with applications in minimizing DC functions

Open Mathematics
In this study, we discuss on the problem of minimizing the differences of two non-positive valued increasing, co-radiant and quasi-concave (ICRQC) functions defined on XX (where XX is a real locally convex topological vector space).
Mirzadeh Somayeh, Barsam Hasan, Ciurdariu Loredana   +2 more
doaj   +1 more source

On the Necessity of the Sufficient Conditions in Cone-Constrained Vector Optimization [PDF]

, 2014
The object of investigation in this paper are vector nonlinear programming problems with cone constraints. We introduce the notion of a Fritz John pseudoinvex cone-constrained vector problem.
Ivanov, Vsevolod I.
core  

A Note on the Convergence of ADMM for Linearly Constrained Convex Optimization Problems

, 2016
This note serves two purposes. Firstly, we construct a counterexample to show that the statement on the convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex optimization problems in a highly ...
Chen, Liang, Sun, Defeng, Toh, Kim-Chuan
core   +1 more source

Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition

EURO Journal on Computational Optimization, 2015
Quantified linear programs (QLPs) are linear programs with variables being either existentially or universally quantified. QLPs are convex multistage decision problems on the one side, and two-person zero-sum games between an existential and a universal ...
Ulf Lorenz, Jan Wolf
doaj  

ON NECESSARY CONDITIONS FOR EFFICIENCY IN DIRECTIONALLY DIFFERENTIABLE OPTIMIZATION PROBLEMS [PDF]

This paper deals with multiobjective programming problems with in- equality, equality and set constraints involving Dini or Hadamard differentiable func- tions.
Do Van Luu, Manh-Hung Nguyen
core   +3 more sources

Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity

Journal of Inequalities and Applications, 2011
In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the ...
Kailey N, Gupta SK, Ahmad Izhar, Agarwal Ravi   +3 more
doaj  

On constrained set-valued optimization [PDF]

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  

Geometric Duality for Convex Vector Optimization Problems [PDF]

, 2011
Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space.
Heyde, Frank
core  

On ε-optimality conditions for multiobjective fractional optimization problems

Fixed 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  

Higher-order optimality conditions with an arbitrary non-differentiable function

, 2016
In this paper, we introduce a new higher-order directional derivative and higher-order subdifferential of Hadamard type of a given proper extended real function.
Ivanov, Vsevolod I.
core   +1 more source