Skip to main content

previous disabled Page of 2
and
  1. No Access

    Article

    Distributionally Robust Mean-CVaR Portfolio Optimization with Cardinality Constraint

    For a mean-CVaR model with cardinality constraint, we consider the situation where the true distribution of underlying uncertainty is unknown. We develop a distributionally robust mean-CVaR model with cardinal...

    Shuang Wang, Li-** Pang, Shuai Wang in Journal of the Operations Research Society… (2023)

  2. No Access

    Article

    A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems

    We propose a class of infeasible proximal bundle methods for solving nonsmooth nonconvex multi-objective optimization problems. The proposed algorithms have no requirements on the feasibility of the initial po...

    Li-** Pang, Fan-Yun Meng, Jian-Song Yang in Journal of Global Optimization (2023)

  3. No Access

    Article

    \({\cal U}{\cal V}\) -theory of a Class of Semidefinite Programming and Its Applications

    In this paper we study optimization problems involving convex nonlinear semidefinite programming (CSDP). Here we convert CSDP into eigenvalue problem by exact penalty function, and apply the

    Ming Huang, **-long Yuan, Li-** Pang in Acta Mathematicae Applicatae Sinica, Engli… (2021)

  4. No Access

    Article

    A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods

    We propose a discretization algorithm for solving a class of nonsmooth convex semi-infinite programming problems that is based on a bundle method. Instead of employing the inexact calculation to evaluate the l...

    Li-** Pang, Qi Wu, **-He Wang, Qiong Wu in Computational Optimization and Applications (2020)

  5. No Access

    Article

    Causal inference for left-truncated and right-censored data with covariate measurement error

    Causal inference is an important tool in observational studies. Many estimation procedures have been developed under complete data and precise measurements. However, when the datasets contain the incomplete r...

    Li-Pang Chen in Computational and Applied Mathematics (2020)

  6. No Access

    Article

    An Inexact Modified Newton Method for Viscc and Application in Gras** Force

    For the variational inequality with symmetric cone constraints problem, we consider using the inexact modified Newton method to efficiently solve it. It provides a unified framework for dealing with the variat...

    Shuang Chen, Li-** Pang, Dan Li in Acta Mathematicae Applicatae Sinica, Engli… (2019)

  7. No Access

    Article

    A Class of Alternating Linearization Algorithms for Nonsmooth Convex Optimization

    We consider the problems of minimizing the sum of a continuously differentiable convex function and a nonsmooth convex function in this paper. These problems arise in many applications of practical interest. A...

    Dan Li, Jie Shen, Yuan Lu, Li-** Pang in Acta Mathematicae Applicatae Sinica, Engli… (2019)

  8. No Access

    Article

    A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information

    We propose an inexact proximal bundle method for constrained nonsmooth nonconvex optimization problems whose objective and constraint functions are known through oracles which provide inexact information. The ...

    Jian Lv, Li-** Pang, Fan-Yun Meng in Journal of Global Optimization (2018)

  9. No Access

    Article

    Generalized latin matrix and construction of orthogonal arrays

    In this paper, generalized Latin matrix and orthogonal generalized Latin matrices are proposed. By using the property of orthogonal array, some methods for checking orthogonal generalized Latin matrices are pr...

    Shan-qi Pang, Li-yan Chen in Acta Mathematicae Applicatae Sinica, English Series (2017)

  10. No Access

    Article

    An approximate bundle method for solving nonsmooth equilibrium problems

    We present an approximate bundle method for solving nonsmooth equilibrium problems. An inexact cutting-plane linearization of the objective function is established at each iteration, which is actually an appro...

    Fan-Yun Meng, Li-** Pang, Jian Lv, **-He Wang in Journal of Global Optimization (2017)

  11. No Access

    Article

    A Fast Space-decomposition Scheme for Nonconvex Eigenvalue Optimization

    In this paper, a nonsmooth bundle algorithm to minimize the maximum eigenvalue function of a nonconvex smooth function is presented. The bundle method uses an oracle to compute separately the function and subg...

    Ming Huang, Li-** Pang, Yuan Lu, Zun-Quan **a in Set-Valued and Variational Analysis (2017)

  12. No Access

    Article

    SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization

    In this paper we apply modified Newton method based on sample average approximation (SAA) to solve stochastic variational inequality with stochastic second-order cone constraints (SSOCCVI). Under some moderate...

    Shuang Chen, Li-** Pang, Xue-Fei Ma in Mathematical Methods of Operations Research (2016)

  13. No Access

    Article

    Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems

    Semi-infinite problem (SIPs) are widely used in many control systems for solving complex control problem, such as polymerase chain reaction control system or other real time control system. In this paper, we p...

    Li-** Pang, Jian Lv, **-He Wang in Computational Optimization and Applications (2016)

  14. Article

    Open Access

    On local aspects of sensitivity in topological dynamics

    In this paper along with the research on weakly mixing sets and transitive sets, we introduce a local aspect of sensitivity in topological dynamics and give the concept of an s-set. It is shown that a weakly m...

    Lei Liu, Haitao Li, **li Pang in Advances in Difference Equations (2015)

  15. No Access

    Article

    Optimality Conditions for Multiobjective Optimization Problem Constrained by Parameterized Variational Inequalities

    We study a multiobjective optimality problem constrained by parameterized variational inequalities. By separation theorem for convex sets, we translate the multiobjective optimality problem into single objecti...

    Li-** Pang, Fan-Yun Meng, Shuang Chen, Dan Li in Set-Valued and Variational Analysis (2014)

  16. No Access

    Article

    The space decomposition theory for a class of eigenvalue optimizations

    In this paper we study optimization problems involving eigenvalues of symmetric matrices. One of the difficulties with numerical analysis of such problems is that the eigenvalues, considered as functions of a ...

    Ming Huang, Li-** Pang, Zun-Quan **a in Computational Optimization and Applications (2014)

  17. No Access

    Article

    The hamiltonian numbers in digraphs

    In the paper, we study the hamiltonian numbers in digraphs. A hamiltonian walk of a digraph D is a closed spanning directed walk with minimum length in D. The length of a hamiltonian walk of a digraph D is called...

    Ting-Pang Chang, Li-Da Tong in Journal of Combinatorial Optimization (2013)

  18. No Access

    Article

    Hamiltonian numbers of Möbius double loop networks

    For the study of hamiltonicity of graphs and digraphs, Goodman and Hedetniemi introduced the concept of Hamiltonian number. The Hamiltonian number h(D) of a digraph D is the minimum length of a cl...

    Gerard J. Chang, Ting-Pang Chang, Li-Da Tong in Journal of Combinatorial Optimization (2012)

  19. No Access

    Article

    On the Convergence of Coderivative of SAA Solution Map** for a Parametric Stochastic Variational Inequality

    The aim of this paper is to investigate the convergence properties for Mordukhovich’s coderivative of the solution map of the sample average approximation (SAA) problem for a parametric stochastic variational ...

    Jie Zhang, Li-wei Zhang, Li-** Pang in Set-Valued and Variational Analysis (2012)

  20. No Access

    Article

    A VU-decomposition method for a second-order cone programming problem

    A VU-decomposition method for solving a second-order cone problem is presented in this paper. It is first transformed into a nonlinear programming problem. Then, the structure of the Clarke subdifferential corres...

    Yuan Lu 陆媛, Li-** Pang 庞丽萍, Zun-quan **a 夏尊铨 in Applied Mathematics and Mechanics (2010)

previous disabled Page of 2