Generalized DEA model of fundamental analysis and its application to portfolio optimization

NCP Edirisinghe, X Zhang - Journal of banking & finance, 2007 - Elsevier
Fundamental analysis is used in asset selection for equity portfolio management. In this
paper, a generalized data envelopment analysis (DEA) model is developed to analyze a …

An algorithm for nonlinear optimization problems with binary variables

W Murray, KM Ng - Computational optimization and applications, 2010 - Springer
One of the challenging optimization problems is determining the minimizer of a nonlinear
programming problem that has binary variables. A vexing difficulty is the rate the work to …

Discrete filled function method for discrete global optimization

CK Ng, LS Zhang, D Li, WW Tian - Computational Optimization and …, 2005 - Springer
A discrete filled function method is developed in this paper to solve discrete global
optimization problems over “strictly pathwise connected domains.” Theoretical properties of …

Input/output selection in DEA under expert information, with application to financial markets

NCP Edirisinghe, X Zhang - European journal of operational research, 2010 - Elsevier
Data envelopment analysis (DEA), as generally used, assumes precise knowledge
regarding which variables are inputs and outputs; however, in many applications, there …

Discrete global descent method for discrete global optimization and nonlinear integer programming

CK Ng, D Li, LS Zhang - Journal of Global Optimization, 2007 - Springer
A novel method, entitled the discrete global descent method, is developed in this paper to
solve discrete global optimization problems and nonlinear integer programming problems …

A continuation approach for solving nonlinear optimization problems with discrete variables

KM Ng - 2002 - search.proquest.com
A new approach to solving nonlinear optimization problems with discrete variables using
continuation methods is described. Our focus is on pure integer nonlinear optimization …

[PDF][PDF] A filled function method for constrained nonlinear integer programming

Y Yang, Z Wu, F Bai - Journal of Industrial and Management …, 2008 - core.ac.uk
A filled function method is presented in this paper to solve constrained nonlinear integer
programming problems. It is shown that for a given non-global local minimizer, a better local …

A new filled function method for nonlinear integer programming problem

YH Gu, ZY Wu - Applied mathematics and computation, 2006 - Elsevier
In this paper, we develop a new filled function method to solve nonlinear integer
programming problem. It is shown that any local minimizer of the new filled function …

New tunnel-filled function method for discrete global optimization

JR Li, YL Shang, P Han - Journal of the Operations Research Society of …, 2017 - Springer
In this paper, a new transformation function was proposed for finding global minimizer of
discrete optimization problems. We proved that under some general assumptions the new …

[HTML][HTML] A discrete dynamic convexized method for nonlinear integer programming

W Zhu, H Fan - Journal of Computational and Applied Mathematics, 2009 - Elsevier
In this paper, we consider the box constrained nonlinear integer programming problem. We
present an auxiliary function, which has the same discrete global minimizers as the problem …