The following pages link to Paul Tseng (Q535017):
Displaying 50 items.
- (Q206682) (redirect page) (← links)
- A first-order interior-point method for linearly constrained smooth optimization (Q535018) (← links)
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints (Q538293) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- A block coordinate gradient descent method for regularized convex separable optimization and covariance selection (Q644904) (← links)
- A Stackelberg game approach to distributed spectrum management (Q644909) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- On a global projection-type error bound for the linear complementarity problem (Q677141) (← links)
- On the convergence of the exponential multiplier method for convex programming (Q688911) (← links)
- Analysis of nonsmooth vector-valued functions associated with second-order cones. (Q703215) (← links)
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
- A decomposition property for a class of square matrices (Q810110) (← links)
- Existence of global minima for constrained optimization (Q857595) (← links)
- Set intersection theorems and existence of optimal solutions (Q879966) (← links)
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties (Q879968) (← links)
- On almost smooth functions and piecewise smooth functions (Q881610) (← links)
- Relaxation methods for monotropic programs (Q909583) (← links)
- Some convex programs without a duality gap (Q959958) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Decomposition algorithm for convex differentiable minimization (Q1176837) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- On the convergence of the affine-scaling algorithm (Q1196183) (← links)
- On a global error bound for a class of monotone affine variational inequality problems (Q1197896) (← links)
- Merit functions for semi-definite complementarity problems (Q1290658) (← links)
- Convergence and error bound for perturbation of linear programs (Q1294827) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems (Q1321256) (← links)
- On some interior-point algorithms for nonconvex quadratic optimization (Q1396211) (← links)
- Non-interior continuation methods for solving semidefinite complementarity problems (Q1396829) (← links)
- Efficient computation of multiple solutions in quasibrittle fracture analysis (Q1402568) (← links)
- Nearest \(q\)-flat to \(m\) points (Q1579644) (← links)
- The LeChatelier principle: The long and the short of it (Q1584696) (← links)
- An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems (Q1591357) (← links)
- Co-NP-completeness of some matrix classification problems (Q1591363) (← links)
- Objective-derivative-free methods for constrained optimization (Q1600094) (← links)
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search (Q1610317) (← links)
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization (Q1777447) (← links)
- Implementation and test of auction methods for solving generalized network flow problems with separable convex cost (Q1810926) (← links)
- A simple complexity proof for a polynomial-time linear programming algorithm (Q1824548) (← links)
- Some methods based on the D-gap function for solving monotone variational inequalities (Q1841559) (← links)
- Linearly constrained convex programming as unconstrained differentiable concave programming (Q1897463) (← links)
- On linear convergence of iterative methods for the variational inequality problem (Q1900764) (← links)
- Incrementally updated gradient methods for constrained and regularized optimization (Q2251572) (← links)
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
- Dual coordinate ascent methods for non-strictly convex minimization (Q2368079) (← links)
- Growth behavior of a class of merit functions for the nonlinear complementarity problem (Q2564173) (← links)
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
