论文列表及评分结果
On the selection of parameters in Self Scaling Variable Metric Algorithms.
电商所评分：8
A "from scratch" proof of a theorem of Rockafellar and Fulkerson.
电商所评分：3
A bilinear programming formulation of the 3-dimensional assignment problem.
电商所评分：1
Note on a method of conjugate subgradients for minimizing nondifferentiable functions.
电商所评分：6
Note on an extension of "Davidon" methods to nondifferentiable functions.
电商所评分：4
A cutting plane algorithm for convex programming that uses analytic centers.
电商所评分：3
A cutting plane method from analytic centers for stochastic programming.
电商所评分：1
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.
电商所评分：5
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities.
电商所评分：4
New variants of bundle methods.
电商所评分：3
Complexity estimates of some cutting plane methods based on the analytic barrier.
电商所评分：1
An interior-point method for generalized linear-fractional programming.
电商所评分：7
A primal-dual potential reduction method for problems involving matrix inequalities.
电商所评分：3
A continuation method for monotone variational inequalities.
电商所评分：1
Nonlinear mappings associated with the generalized linear complementarity problem.
电商所评分：8
About strongly polynomial time algorithms for quadratic optimization over submodular constraints.
电商所评分：8
Superlinear primal-dual affine scaling algorithms for LCP.
电商所评分：2
Worst-case comparison of valid inequalities for the TSP.
电商所评分：5
A quadratically convergent O((k+1)root(n)L)-iteration algorithm for the P(k)-matrix linear complementarity problem.
电商所评分：10
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands.
电商所评分：4
Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs.
电商所评分：1
Dual decomposition of a single-machine scheduling problem.
电商所评分：10
The complexity of approximating a nonlinear program.
电商所评分：7
Pure adaptive search for finite global optimization.
电商所评分：7
New algorithms for linear k-matroid intersection and matroid k-parity problems.
电商所评分：2
On games corresponding to sequencing situations with ready times.
电商所评分：9
Computing optimal scalings by parametric network algorithms.
电商所评分：8
Extracting embedded generalized networks from linear programming problems.
电商所评分：4
Simple bounds for solutions of monotone complementarity problems and convex programs.
电商所评分：6
A fast and robust unconstrained optimization method requiring minimum storage.
电商所评分：8