Polynomially bounded algorithms for locatingp-centers on a tree
- 期刊名称Mathematical Programming
- 作者R. Chandrasekaran; A. Tamir
- 卷第22卷
- 期第1期
- 印刷ISSN0025-5610
- 电子ISSN1436-4646
- 文件大小660.89KB
- 发表时间1982
- DOI10.1007/bf01581045
- 页码304-315
Segmentation of Pulmonary Nodule Images Using 1-Norm MinimizationThomas F. Coleman; Yuying Li; Adrian Mariano · Computational Optimization and Applications · 2001
A Global and Quadratically Convergent Method for Linear l∞ProblemsThomas F. Coleman and Yuying Li · SIAM Journal on Numerical Analysis · 1992
Computation and analysis for a constrained entropy optimization problem in financeChanghong He; Thomas F. Coleman; Yuying Li · 2008
Discrete hedging of American-type options using local risk minimizationThomas F. Coleman; Dmitriy Levchenkov; Yuying Li · 2007
Hedging guarantees in variable annuities under both equity and interest rate risksThomas F. Coleman; Yuying Li; Maria-Cristina Patron · 2006
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to boundsThomas F. Coleman; Yuying Li · Mathematical Programming · 1994
A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraintsThomas F. Coleman; Yuying Li · Mathematical Programming · 2000
Fully copositive matricesG. S. R. Murthy; T. Parthasarathy · Mathematical Programming · 1998
Election of CouncilMathematical Programming · 1973
Editorial policyMathematical Programming · 1973
The Mathematical Programming SocietyMathematical Programming · 1973
A linear max—min problemJames E. Falk · Mathematical Programming · 1973
Unconstrained optimization based on homogeneous modelsChristakis Charalambous · Mathematical Programming · 1973
Computable error bounds for nonlinear programmingStephen M. Robinson · Mathematical Programming · 1973
Book reviewW. F. Lucas · Mathematical Programming · 1973