The following pages link to Jie Sun (Q237875):
Displaying 40 items.
- 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)
- (Q4429173) (← links)
- Strong Semismoothness of Eigenvalues of Symmetric Matrices and Its Application to Inverse Eigenvalue Problems (Q4443575) (← links)
- The Convergent Generalized Central Paths for Linearly Constrained Convex Programming (Q4641644) (← links)
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems (Q4651970) (← links)
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs (Q4651988) (← links)
- A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems (Q4785865) (← links)
- (Q4840111) (← links)
- (Q4963657) (← links)
- (Q5013542) (← links)
- (Q5045887) (← links)
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems (Q5085476) (← links)
- A Model of Multistage Risk-Averse Stochastic Optimization and its Solution by Scenario-Based Decomposition Algorithms (Q5149518) (← links)
- Robust two-stage stochastic linear programs with moment constraints (Q5169460) (← links)
- (Q5202851) (← links)
- Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
- Two-Stage Quadratic Games under Uncertainty and Their Solution by Progressive Hedging Algorithms (Q5231685) (← links)
- Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems (Q5245367) (← links)
- Analysis of some interior point continuous trajectories for convex programming (Q5277955) (← links)
- (Q5402625) (← links)
- New bounds for the price of anarchy under nonlinear and asymmetric costs (Q5413885) (← links)
- (Q5462171) (← links)
- (Q5462175) (← links)
- A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution (Q5481687) (← links)
- Semismooth Matrix-Valued Functions (Q5704068) (← links)
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems (Q5704080) (← links)
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems (Q5704113) (← links)
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization (Q5704185) (← links)
- Error Bounds for Degenerate Cone Inclusion Problems (Q5704245) (← links)
- Second‐Order Sufficient Conditions for Error Bounds in Banach Spaces (Q5757349) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
- Analysis of third-party warehousing contracts with commitments (Q5935391) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
- Global convergence of conjugate gradient methods without line search (Q5959294) (← links)
- A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize (Q6097380) (← links)
- Risk-averse optimal control model under uncertainty and its modified progressive hedging algorithm (Q6636816) (← links)
- Two inertial proximal coordinate algorithms for a family of nonsmooth and nonconvex optimization problems (Q6659287) (← links)
- Convergence analysis of four interior point continuous trajectories for convex semidefinite programming (Q6664315) (← links)
- A matrix-free interior point continuous trajectory for linearly constrained convex programming (Q6760156) (← links)
