Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 147
Volume 147, Numbers 1-2, October 2014
- Leah Epstein, Asaf Levin
:
An efficient polynomial time approximation scheme for load balancing on uniformly related machines. 1-23 - Amir Beck, Shoham Sabach:
A first order method for finding minimal norm-like solutions of convex optimization problems. 25-46 - Jorge R. Vera:
Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization. 47-79 - Hiroshi Hirai, Gyula Pap:
Tree metrics and edge-disjoint S-paths. 81-123 - Zhaosong Lu:
Iterative hard thresholding methods for l0 regularized convex cone programming. 125-154 - M. Seetharama Gowda, Jiyuan Tao:
On the bilinearity rank of a proper cone and Lyapunov-like transformations. 155-170 - Vaithilingam Jeyakumar, Guoyin Li:
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. 171-206 - Martin E. Dyer, Ravi Kannan, Leen Stougie:
A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming. 207-229 - Roberto Cominetti, Cristóbal Guzmán:
Network congestion control with Markovian multipath routing. 231-251 - Walter F. Mascarenhas:
The divergence of the BFGS and Gauss Newton methods. 253-276 - Zhaosong Lu:
Iterative reweighted minimization methods for lp regularized unconstrained nonlinear programming. 277-307 - Carla Michini, Antonio Sassano:
The Hirsch Conjecture for the fractional stable set polytope. 309-330 - Gerd Wachsmuth:
The numerical solution of Newton's problem of least resistance. 331-350 - Houduo Qi, Xiaoming Yuan:
Computing the nearest Euclidean distance matrix with low embedding dimensions. 351-389 - Alexander Kogan, Miguel A. Lejeune:
Threshold Boolean form for joint probabilistic constraints with random technology matrix. 391-427 - Brendan P. W. Ames:
Guaranteed clustering and biclustering via semidefinite programming. 429-465 - Dmitriy Drusvyatskiy, Adrian S. Lewis:
Optimality, identifiability, and sensitivity. 467-498 - Xiumei Wang, Xiaoxin Song, Jinjiang Yuan:
On matching cover of graphs. 499-518 - Si Tiep Dinh, Huy Vui Ha, Tien Son Pham:
A Frank-Wolfe type theorem for nondegenerate polynomial programs. 519-538 - Chao Ding, Defeng Sun, Jane J. Ye:
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints. 539-579 - Alexey F. Izmailov:
Strongly regular nonsmooth generalized equations. 581-590
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
