The following pages link to Gongyun Zhao (Q202057):
Displayed 45 items.
- Representing the space of linear programs as the Grassmann manifold (Q847840) (← links)
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- Item:Q202057 (redirect page) (← links)
- Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory (Q927226) (← links)
- On the implementation of a log-barrier progressive hedging method for multistage stochastic programs (Q964982) (← links)
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem (Q985306) (← links)
- On the complexity of following the central path of linear programs by linear extrapolation. II (Q1181914) (← links)
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals (Q1205513) (← links)
- Item:Q202057 (redirect page) (← links)
- Quadratic convergence of a long-step interior-point method for nonlinear monotone variational inequality problems (Q1265014) (← links)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
- Nonminimal product differentiation as a bargaining outcome. (Q1395586) (← links)
- \(L\)-shaped algorithm for two stage problems of stochastic convex programming (Q1429354) (← links)
- Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems (Q1430273) (← links)
- The vector \(F\)-complementary problems with demipseudomonotone mappings in Banach spaces (Q1431968) (← links)
- The upper semicontinuity of the solution maps in vector implicit quasicomplementarity problems of type \(R_{0}^{*1}\) (Q1431997) (← links)
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming (Q1769066) (← links)
- A note on treating a second order cone program as a special case of a semidefinite program (Q1774167) (← links)
- On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems (Q1819152) (← links)
- A class of global optimization problems as models of the phase unwrapping problem (Q1850828) (← links)
- A note on linear complementarity problems and multiple objective programming (Q1881564) (← links)
- A finite branch-and-bound algorithm for two-stage stochastic integer programs (Q1881566) (← links)
- The curvature integral and the complexity of linear complementarity problems (Q1904662) (← links)
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization (Q2576736) (← links)
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems<sup>*</sup> (Q2709447) (← links)
- (Q3348700) (← links)
- Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic Programs (Q3544256) (← links)
- Lagrangian-Dual Functions and Moreau–Yosida Regularization (Q3608971) (← links)
- Complementarity demand functions and pricing models for multi-product markets (Q3639947) (← links)
- (Q3818591) (← links)
- (Q4258626) (← links)
- A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems (Q4337418) (← links)
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard (Q4351192) (← links)
- Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems (Q4389184) (← links)
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path (Q4389198) (← links)
- A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs (Q4441954) (← links)
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs (Q4678764) (← links)
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems (Q4785865) (← links)
- (Q4840116) (← links)
- On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming (Q4877506) (← links)
- The Nature of Equilibria Under Noncollusive Product Design and Collusive Pricing (Q5094544) (← links)
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems (Q5704080) (← links)
- A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs (Q5943079) (← links)