Person:535017

Available identifiers

zbMath Open tseng.paulDBLP10/5935WikidataQ11105290 ScholiaQ11105290MaRDI QIDQ535017

List of research outcomes

Publication	Date of Publication	Type
An ε-Relaxation method for generalized separable convex cost network flow problems	2019-01-11	Paper
Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise	2017-08-08	Paper
Incrementally updated gradient methods for constrained and regularized optimization	2014-07-14	Paper
Convex Relaxations of the Weighted Maxmin Dispersion Problem	2014-04-09	Paper
Hankel Matrix Rank Minimization with Applications to System Identification and Realization	2013-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q4648008	2012-11-08	Paper
(Robust) edge-based semidefinite programming relaxation of sensor network localization	2011-12-14	Paper
A block coordinate gradient descent method for regularized convex separable optimization and covariance selection	2011-11-07	Paper
A Stackelberg game approach to distributed spectrum management	2011-11-07	Paper
Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints	2011-05-25	Paper
A first-order interior-point method for linearly constrained smooth optimization	2011-05-11	Paper
Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning	2011-03-21	Paper
Density Estimation by Total Variation Penalized Likelihood Driven by the Sparsity ℓ1 Information Criterion	2011-02-22	Paper
Approximation accuracy, gradient methods, and error bound for structured convex optimization	2010-11-22	Paper
A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training	2010-10-26	Paper
Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization	2009-05-05	Paper
Some convex programs without a duality gap	2008-12-16	Paper
A coordinate gradient descent method for nonsmooth separable minimization	2008-12-16	Paper
Exact Regularization of Convex Programs	2008-12-05	Paper
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints	2008-02-25	Paper
Second‐Order Cone Programming Relaxation of Sensor Network Localization	2008-02-25	Paper
An Implementable Active‐Set Algorithm for Computing a B‐Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum	2007-11-16	Paper
https://portal.mardi4nfdi.de/entity/Q5310558	2007-10-11	Paper
On almost smooth functions and piecewise smooth functions	2007-05-30	Paper
Set intersection theorems and existence of optimal solutions	2007-05-10	Paper
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties	2007-05-10	Paper
Existence of global minima for constrained optimization	2006-12-19	Paper
On the Statistical Analysis of Smoothing by Maximizing Dirty Markov Random Field Posterior Distributions	2006-06-26	Paper
Enhanced Fritz John Conditions for Convex Programming	2006-05-30	Paper
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem	2005-12-14	Paper
An ϵ-Out-of-Kilter Method for Monotropic Programming	2005-11-11	Paper
An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods	2005-11-11	Paper
Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization	2005-05-17	Paper
Analysis of nonsmooth vector-valued functions associated with second-order cones.	2005-01-11	Paper
An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems	2004-01-27	Paper
Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems	2004-01-19	Paper
A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization	2004-01-19	Paper
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation	2004-01-19	Paper
Efficient computation of multiple solutions in quasibrittle fracture analysis	2003-08-28	Paper
Non-interior continuation methods for solving semidefinite complementarity problems	2003-07-13	Paper
Implementation and test of auction methods for solving generalized network flow problems with separable convex cost	2003-06-09	Paper
Convergence of a block coordinate descent method for nondifferentiable minimization	2003-02-16	Paper
Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization	2003-01-05	Paper
Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search	2002-08-19	Paper
Objective-derivative-free methods for constrained optimization	2002-06-12	Paper
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization	2002-05-06	Paper
Smoothing Functions for Second-Order-Cone Complementarity Problems	2002-04-23	Paper
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints	2002-04-23	Paper
On some interior-point algorithms for nonconvex quadratic optimization	2002-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q2743983	2001-09-18	Paper
https://portal.mardi4nfdi.de/entity/Q4762533	2001-08-02	Paper
The LeChatelier principle: The long and the short of it	2001-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q2718677	2001-05-30	Paper
Some methods based on the D-gap function for solving monotone variational inequalities	2001-02-18	Paper
Co-NP-completeness of some matrix classification problems	2000-12-20	Paper
https://portal.mardi4nfdi.de/entity/Q4945779	2000-09-24	Paper
Nearest \(q\)-flat to \(m\) points	2000-09-14	Paper
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings	2000-03-19	Paper
Fortified-Descent Simplicial Search Method: A General Approach	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4252833	2000-01-13	Paper
Merit functions for semi-definite complementarity problems	1999-06-03	Paper
Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗	1999-03-22	Paper
Convergence and error bound for perturbation of linear programs	1999-01-01	Paper
An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule	1998-05-12	Paper
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities	1998-02-10	Paper
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems	1998-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q4363162	1997-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q4352307	1997-11-11	Paper
On a global projection-type error bound for the linear complementarity problem	1997-10-15	Paper
https://portal.mardi4nfdi.de/entity/Q4353542	1997-09-10	Paper
Growth behavior of a class of merit functions for the nonlinear complementarity problem	1997-07-20	Paper
Modified Projection-Type Methods for Monotone Variational Inequalities	1997-07-08	Paper
An Infeasible Path-Following Method for Monotone Complementarity Problems	1997-06-12	Paper
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach	1997-01-05	Paper
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions	1996-10-16	Paper
A Unified Analysis of Hoffman’s Bound via Fenchel Duality	1996-07-08	Paper
Partial Affine-Scaling for Linearly Constrained Minimization	1996-02-25	Paper
On linear convergence of iterative methods for the variational inequality problem	1995-10-23	Paper
Linearly constrained convex programming as unconstrained differentiable concave programming	1995-08-27	Paper
Partial Proximal Minimization Algorithms for Convex Pprogramming	1995-08-08	Paper
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization	1995-01-19	Paper
Perturbation Analysis of a Condition Number for Linear Systems	1994-11-17	Paper
On the rate of convergence of a distributed asynchronous routing algorithm	1994-09-28	Paper
A Path-Following Algorithm for Linear Programming Using Quadratic and Logarithmic Penalty Functions	1994-09-04	Paper
Descent methods for convex essentially smooth minimization	1994-04-27	Paper
On the convergence of the coordinate descent method for convex differentiable minimization	1994-04-27	Paper
Global linear convergence of a path-following algorithm for some monotone variational inequality problems	1994-04-27	Paper
Error bounds and convergence analysis of feasible descent methods: A general approach	1994-02-07	Paper
On the convergence of the exponential multiplier method for convex programming	1993-11-01	Paper
Dual coordinate ascent methods for non-strictly convex minimization	1993-08-22	Paper
Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set	1993-06-29	Paper
On a global error bound for a class of monotone affine variational inequality problems	1993-01-16	Paper
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem	1993-01-16	Paper
On the Convergence of the Products of Firmly Nonexpansive Mappings	1993-01-16	Paper
On the convergence of the affine-scaling algorithm	1992-12-17	Paper
On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm	1992-09-27	Paper
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function	1992-06-28	Paper
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization	1992-06-28	Paper
Relaxation Method for Large Scale Linear Programming Using Decomposition	1992-06-28	Paper
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints	1992-06-27	Paper
Decomposition algorithm for convex differentiable minimization	1992-06-25	Paper
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities	1992-06-25	Paper
A decomposition property for a class of square matrices	1991-01-01	Paper
On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem	1991-01-01	Paper
Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems	1990-01-01	Paper
Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition	1990-01-01	Paper
Relaxation methods for monotropic programs	1990-01-01	Paper
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming	1990-01-01	Paper
Solving H-horizon, stationary Markov decision problems in time proportional to log (H)	1990-01-01	Paper
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach	1990-01-01	Paper
A simple complexity proof for a polynomial-time linear programming algorithm	1989-01-01	Paper
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems	1988-01-01	Paper
Relaxation methods for problems with strictly convex separable costs and linear constraints	1987-01-01	Paper
Relaxation Methods for Network Flow Problems with Convex Arc Costs	1987-01-01	Paper
Relaxation Methods for Linear Programs	1987-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Paul Tseng