The following pages link to Bo Yu (Q209561):
Displaying 50 items.
- A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
- Proof of a conjecture on a discretized elliptic equation with cubic nonlinearity (Q365843) (← links)
- Robust continuation methods for tracing solution curves of parameterized systems (Q457042) (← links)
- CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems (Q457217) (← links)
- Group update method for sparse minimax problems (Q493251) (← links)
- A homotopy method based on penalty function for nonlinear semidefinite programming (Q496592) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides (Q548308) (← links)
- Homotopy methods for solving variational inequalities in unbounded sets (Q556007) (← links)
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
- A boundary perturbation interior point homotopy method for solving fixed point problems (Q629228) (← links)
- A constraint shifting homotopy method for convex multi-objective programming (Q651890) (← links)
- A smoothing homotopy method based on Robinson's normal equation for mixed complementarity problems (Q656453) (← links)
- Low dimensional simplex evolution: a new heuristic for global optimization (Q656836) (← links)
- Homotopy method for a mean curvature-based denoising model (Q765268) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- Solving nonconvex nonlinear programming problems via a new aggregate constraint homotopy method (Q988146) (← links)
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- A modified homotopy method for solving the principal-agent bilevel programming problem (Q1655396) (← links)
- An alternating direction and projection algorithm for structure-enforced matrix factorization (Q1687315) (← links)
- Efficiently counting affine roots of mixed trigonometric polynomial systems (Q1697755) (← links)
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints (Q1724113) (← links)
- The distributionally robust optimization reformulation for stochastic complementarity problems (Q1724184) (← links)
- Eigenfunction expansion method for multiple solutions of fourth-order ordinary differential equations with cubic polynomial nonlinearity (Q1744323) (← links)
- An efficient duality-based approach for PDE-constrained sparse optimization (Q1744892) (← links)
- An FE-inexact heterogeneous ADMM for elliptic optimal control problems with \(L^1\)-control cost (Q1757721) (← links)
- A continuation method for solving fixed points of self-mappings in general nonconvex sets (Q1863476) (← links)
- Homotopy method for a class of nonconvex Brouwer fixed-point problems (Q1908258) (← links)
- A novel high-order functional based image registration model with inequality constraint (Q2012916) (← links)
- A multi-level ADMM algorithm for elliptic PDE-constrained optimization problems (Q2027683) (← links)
- KDE distributionally robust portfolio optimization with higher moment coherent risk (Q2070731) (← links)
- Kernel density estimation based distributionally robust mean-CVaR portfolio optimization (Q2089892) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
- A homotopy method for nonlinear second-order cone programming (Q2256956) (← links)
- An improved discontinuity-preserving image registration model and its fast algorithm (Q2281833) (← links)
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
- Unfoldings and the rank-one approximation of the tensor (Q2309259) (← links)
- A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
- The RCH method for computing minimal polynomials of polynomial matrices (Q2341615) (← links)
- Symmetric homotopy method for discretized elliptic equations with cubic and quintic nonlinearities (Q2356614) (← links)
- Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation (Q2383749) (← links)
- Inseparable robust reward-risk optimization models with distribution uncertainty (Q2396920) (← links)
- A local information based variational model for selective image segmentation (Q2437936) (← links)
- Globally convergent homotopy method for designing piecewise linear deterministic contractual function (Q2438397) (← links)
- A smoothing homotopy method for variational inequality problems on polyhedral convex sets (Q2442638) (← links)
- A note on the relation between the Newton homotopy method and the damped Newton method (Q2450057) (← links)
- A polynomial path following algorithm for convex programming (Q2479155) (← links)
- Homotopy method for solving variational inequalities with bounded box constraints (Q2479287) (← links)
