The following pages link to Li-Ping Pang (Q288403):
Displaying 50 items.
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Risk management in portfolio applications of non-convex stochastic programming (Q300194) (← links)
- SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization (Q328526) (← links)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
- A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
- On the convergence of coderivative of SAA solution mapping for a parametric stochastic variational inequality (Q430139) (← links)
- Differential properties of the symmetric matrix-valued Fischer-Burmeister function (Q430950) (← links)
- The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
- (Q481055) (redirect page) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- An algorithm for solving optimization problems with fuzzy relational inequality constraints (Q497647) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- Optimality conditions for multiobjective optimization problem constrained by parameterized variational inequalities (Q742188) (← links)
- A novel interacting multiple model algorithm (Q839071) (← links)
- The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions (Q871665) (← links)
- A quasi-Newton bundle method based on approximate subgradients (Q874359) (← links)
- A proximal bundle method with inexact data for convex nondifferentiable minimization (Q876907) (← links)
- An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition (Q879572) (← links)
- Two parallel distribution algorithms for convex constrained minimization problems (Q884654) (← links)
- A \(\mathcal{UV}\)-decomposed method for solving an MPEC problem (Q940607) (← links)
- A bundle-type auxiliary problem method for solving generalized variational-like inequalities (Q945201) (← links)
- A superlinear space decomposition algorithm for constrained nonsmooth convex program (Q964944) (← links)
- An approximate decomposition algorithm for convex minimization (Q966076) (← links)
- Existence of solutions of generalized vector variational-type inequalities with set-valued mappings (Q980194) (← links)
- First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization (Q1004831) (← links)
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities (Q1007656) (← links)
- Asymptotical stability of a nonlinear non-differentiable dynamic system in microbial continuous cultures (Q1629925) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- Inexact SA method for constrained stochastic convex SDP and application in Chinese stock market (Q1709750) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- Research on adjoint kernelled quasidifferential (Q1722144) (← links)
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1722320) (← links)
- The space decomposition theory for a class of semi-infinite maximum eigenvalue optimizations (Q1725116) (← links)
- Correction to: ``A space decomposition scheme for maximum eigenvalue functions and its applications'' (Q1750399) (← links)
- On a second order parallel variable transformation approach. (Q1871435) (← links)
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions (Q1930995) (← links)
- A decomposition method with redistributed subroutine for constrained nonconvex optimization (Q1949452) (← links)
- A proximal analytic center cutting plane algorithm for solving variational inequality problems (Q1952872) (← links)
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
- An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information (Q2031374) (← links)
- A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
- A \({\mathcal {VU}}\)-decomposition method for a second-order cone programming problem (Q2269047) (← links)
- An inexact modified Newton method for VISCC and application in grasping force (Q2274183) (← links)
- An adaptive fixed-point proximity algorithm for solving total variation denoising models (Q2293175) (← links)
- Asymptotic convergence of stationary points of stochastic multiobjective programs with parametric variational inequality constraint via SAA approach (Q2315596) (← links)
- A class of alternating linearization algorithms for nonsmooth convex optimization (Q2316308) (← links)