Results 71 to 80 of about 1,594 (145)

A filled function method for nonlinear systems of equalities and inequalities

open access: yes, 2012
In this paper a filled function method is suggested for solving nonlinear systems of equalities and inequalities. Firstly, the original problem is reformulated into an equivalent constrained global optimization problem.
Z. Wan, Liuyang Yuan, Jiawei Chen
semanticscholar   +1 more source

Best proximity point theorems for reckoning optimal approximate solutions

open access: yes, 2012
Given a non-self mapping from A to B, where A and B are subsets of a metric space, in order to compute an optimal approximate solution of the equation Sx=x, a best proximity point theorem probes into the global minimization of the error function x⟶d(x,Sx)
S. Basha, N. Shahzad, R. Jeyaraj
semanticscholar   +1 more source

Joint location and pricing within a user-optimized environment

open access: yesEURO Journal on Computational Optimization, 2020
In the design of service facilities, whenever the behaviour of customers is impacted by queueing or congestion, the resulting equilibrium cannot be ignored by a firm that strives to maximize revenue within a competitive environment.
Teodora Dan   +2 more
doaj  

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  

Centrosymmetric, Skew Centrosymmetric and Centrosymmetric Cauchy Tensors [PDF]

open access: yes, 2014
Recently, Zhao and Yang introduced centrosymmetric tensors. In this paper, we further introduce skew centrosymmetric tensors and centrosymmetric Cauchy tensors, and discuss properties of these three classes of structured tensors.
Chen, Haibin, Chen, Zhen, Qi, Liqun
core  

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  

An economic order quantity model with reverse logistics program

open access: yesOperations Research Perspectives, 2020
The economic order quantity (EOQ) model has evolved greatly over past decades on the strength of incorporating realistic factors. In recent times, interest has been geared towards studying the effect of reverse flow of products into inventory system.
S. Sanni, Z. Jovanoski, H.S. Sidhu
doaj  

A modification of the αBB method for box-constrained optimization and an application to inverse kinematics

open access: yesEURO Journal on Computational Optimization, 2016
For many practical applications it is important to determine not only a numerical approximation of one but a representation of the whole set of globally optimal solutions of a non-convex optimization problem.
Gabriele Eichfelder   +2 more
doaj  

An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions

open access: yesEURO Journal on Computational Optimization, 2016
We propose a forward–backward proximal-type algorithm with inertial/memory effects for minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting.
Radu Ioan Boţ   +2 more
doaj  

Sufficient pruning conditions for MINLP in gas network design

open access: yesEURO Journal on Computational Optimization, 2017
One-quarter of Europe’s energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi ...
Jesco Humpola, Felipe Serrano
doaj  

Home - About - Disclaimer - Privacy