Results 61 to 70 of about 1,594 (145)
, 2014 The main purpose of this paper is to introduce an iterative algorithm for equilibrium problems and split feasibility problems in Hilbert spaces. Under suitable conditions we prove that the sequence converges strongly to a common element of the set of ...
Jinfang Tang, Shih-sen Chang, Fei Yuan
semanticscholar +1 more source
Integer Polynomial Optimization in Fixed Dimension
, 2004 We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed.
Barvinok A. I. +9 more
core +4 more sources
Intelligent Systems with Applications, 2022 We propose new mathematical models of inventory management in a reverse logistics system. The proposed models extend the model introduced by Nahmias and Rivera with the assumption that the demand for newly produced and repaired (remanufacturing) items ...
M. Forkan, M.M. Rizvi, M.A.M. Chowdhury
doaj
Tangent cones, starshape and convexity
, 1978 International Journal of Mathematics and Mathematical Sciences, Volume 1, Issue 4, Page 459-477, 1978.
J. M. Borwein
wiley +1 more source
Symmetric duality for a higher-order nondifferentiable multiobjective programming problem
, 2015 In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established considering K-F convexity assumptions.
I. P. Debnath +2 more
semanticscholar +1 more source
Using a Factored Dual in Augmented Lagrangian Methods for Semidefinite Programming
, 2018 In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on how to deal with
De Santis, Marianna +2 more
core +1 more source
On ε-optimality conditions for multiobjective fractional optimization problems
, 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
M. Kim, G. Kim, G. Lee
semanticscholar +1 more source
First-Order Methods for Convex Optimization
EURO Journal on Computational Optimization, 2021 First-order methods for solving convex optimization problems have been at the forefront of mathematical optimization in the last 20 years. The rapid development of this important class of algorithms is motivated by the success stories reported in various
Pavel Dvurechensky +2 more
doaj
Higher-order symmetric duality for a class of multiobjective fractional programming problems
, 2012 In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, α, ρ, d)-convexity, which extends some kinds of generalized convexity,
Gao Ying
semanticscholar +1 more source
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj