Results 41 to 50 of about 173 (143)

Vector optimization problems with weakened convex and weakened affine constraints in linear topological spaces

Open Mathematics
In this article, we work on vector optimization problems in linear topological spaces. Our vector optimization problems have weakened convex inequality constraints and weakened affine equality constraints.
Zeng Renying
doaj   +1 more source

A hybrid approach to the solution of a pricing model with continuous demand segmentation

EURO Journal on Computational Optimization, 2013
Price optimization fits naturally the framework of bilevel programming, where a leader integrates within its decision process the reaction of rational customers.
Patrice Marcotte, Gilles Savard, Alexandre Schoeb   +2 more
doaj   +1 more source

Nonsmooth spectral gradient methods for unconstrained optimization

EURO Journal on Computational Optimization, 2017
To solve nonsmooth unconstrained minimization problems, we combine the spectral choice of step length with two well-established subdifferential-type schemes: the gradient sampling method and the simplex gradient method.
Milagros Loreto, Hugo Aponte, Debora Cores, Marcos Raydan   +3 more
doaj   +1 more source

Some properties of approximate solutions for vector optimization problem with set-valued functions

Vector optimization, Set-valued function, Scalarization, Approximate solution, Quasiconvex set-valued function, 90C26, 90C29, 90C59,
Qiusheng Qiu, Xinmin Yang
core   +1 more source

Generalized McCormick relaxations

Convex relaxations, Global optimization, Optimal control, 49M20, 90C26,
Joseph Scott, Matthew Stuber, Paul Barton   +2 more
core   +1 more source

Duality and optimality conditions for generalized equilibrium problems involving DC functions

, 2009
Equilibrium problems, Duality, Fenchel conjugation, DC functions, Variational inequalities, 49N15, 58E35, 90C26, 90C46,
N. Dinh, J. Strodiot, V. Nguyen, V. H. Nguyen, J. J. Strodiot   +4 more
core   +1 more source

Hybrid conjugate gradient-BFGS methods based on Wolfe line search

, 2022
In this paper, we present some hybrid methods for solving unconstrained optimization problems. These methods are defined using proper combinations of the search directions and included parameters in conjugate gradient and quasi-Newton method of Broyden ...
DJAMEL, Benterki, SAMIA, Khelladi
core   +1 more source

On global optimization with indefinite quadratics

EURO Journal on Computational Optimization, 2017
We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj   +1 more source

Input, output and graph technical efficiency measures on non-convex FDH models with various scaling laws: An integrated approach based upon implicit enumeration algorithms

Data envelopment analysis, free disposal hull, technical efficiency, 90B30, 90B50, 90C26,
Kristiaan Kerstens, Walter Briec
core   +1 more source

Refined optimality conditions for differences of convex functions

Diff-convex, Optimality, 90C26, 90C46,
Tuomo Valkonen
core   +1 more source