Li-Ping Pang

Affiliations:
  • Dalian University of Technology, Department of Applied Mathematics, China


According to our database1, Li-Ping Pang authored at least 41 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The Augmented Lagrangian Method for Mathematical Programs with Vertical Complementarity Constraints Based on Inexact Scholtes Regularization.
Asia Pac. J. Oper. Res., December, 2023

Semantic Segmentation and Depth Estimation Based on Residual Attention Mechanism.
Sensors, September, 2023

A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems.
Numer. Algorithms, July, 2023

A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems.
J. Glob. Optim., April, 2023

A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems.
J. Appl. Math. Comput., February, 2023

A stochastic approximation method for convex programming with many semidefinite constraints.
Optim. Methods Softw., January, 2023

A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization.
J. Comput. Appl. Math., 2023

2022
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming.
Numer. Algorithms, 2022

A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization.
Asia Pac. J. Oper. Res., 2022

Proximal Gradient-Type Algorithms for a Class of Bilevel Programming Problems.
Asia Pac. J. Oper. Res., 2022

2020
An incremental bundle method for portfolio selection problem under second-order stochastic dominance.
Numer. Algorithms, 2020

A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods.
Comput. Optim. Appl., 2020

2019
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems.
Numer. Algorithms, 2019

Nonsmooth Optimization Method for H∞ Output Feedback Control.
Asia Pac. J. Oper. Res., 2019

2018
Correction to: A space decomposition scheme for maximum eigenvalue functions and its applications.
Math. Methods Oper. Res., 2018

A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information.
J. Glob. Optim., 2018

Improved Convergence Properties of the Relaxation Schemes of Kadrani <i>et al.</i> and Kanzow and Schwartz for MPEC.
Asia Pac. J. Oper. Res., 2018

2017
A space decomposition scheme for maximum eigenvalue functions and its applications.
Math. Methods Oper. Res., 2017

An approximate bundle method for solving nonsmooth equilibrium problems.
J. Glob. Optim., 2017

An adaptive fixed-point proximity algorithm for solving total variation denoising models.
Inf. Sci., 2017

2016
SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization.
Math. Methods Oper. Res., 2016

Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems.
Comput. Optim. Appl., 2016

2015
Risk management in portfolio applications of non-convex stochastic programming.
Appl. Math. Comput., 2015

Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization.
Appl. Math. Comput., 2015

2014
A proximal alternating linearization method for nonconvex optimization problems.
Optim. Methods Softw., 2014

Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method.
J. Optim. Theory Appl., 2014

The space decomposition theory for a class of eigenvalue optimizations.
Comput. Optim. Appl., 2014

2013
An algorithm for solving optimization problems with fuzzy relational inequality constraints.
Inf. Sci., 2013

2012
Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions.
Math. Comput. Model., 2012

A Proximal Analytic Center Cutting Plane Algorithm for Solving Variational Inequality Problems.
J. Appl. Math., 2012

A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors.
J. Appl. Math., 2012

2010
An approximate decomposition algorithm for convex minimization.
J. Comput. Appl. Math., 2010

A superlinear space decomposition algorithm for constrained nonsmooth convex program.
J. Comput. Appl. Math., 2010

Existence of solutions of generalized vector variational-type inequalities with set-valued mappings.
Comput. Math. Appl., 2010

2008
An approximate bundle-type auxiliary problem method for solving generalized variational inequalities.
Math. Comput. Model., 2008

A bundle-type auxiliary problem method for solving generalized variational-like inequalities.
Comput. Math. Appl., 2008

First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization.
Comput. Math. Appl., 2008

2007
A method for solving the system of linear equations and linear inequalities.
Math. Comput. Model., 2007

A modified predictor-corrector algorithm for solving nonconvex generalized variational inequality.
Comput. Math. Appl., 2007

An approximate U-Lagrangian and algorithm to UV decomposition.
Appl. Math. Comput., 2007

Two parallel distribution algorithms for convex constrained minimization problems.
Appl. Math. Comput., 2007


  Loading...