]> 2004-11-16 The equivalence of strict convexity and injectivity of the gradient in bounded level sets. 273-278 1991 51 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp51.html#GriewankJK91 2004-11-10 Accumulating Jacobians as chained sparse matrix products. 555-571 2003 95 Math. Program. 3 http://dx.doi.org/10.1007/s10107-002-0329-7 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp95.html#GriewankN03 2004-12-21 ^-2KNM) time. 477-482 1996 75 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp75.html#GrigoriadisK96 2004-12-21 A globally convergent version of the Polak-Ribière conjugate gradient method. 375-391 1997 77 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp78.html#GrippoL97 2004-11-22 Deciding uniqueness in norm maximization. 203-214 1992 57 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp57.html#GritzmannK92 2004-11-29 Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. 163-213 1993 59 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp59.html#GritzmannK93 2006-07-20 Primal-dual nonlinear rescaling method with dynamic scaling parameter update. 237-259 2006 106 Math. Program. 2 http://dx.doi.org/10.1007/s10107-005-0603-6 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp106.html#GrivaP06 2004-11-16 Solution of large-scale symmetric travelling salesman problems. 141-202 1991 51 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp51.html#GrotschelH91 2004-12-13 Packing Steiner trees: polyhedral investigations. 101-123 1996 72 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp72.html#GrotschelMW96 2004-12-13 Packing Steiner trees: a cutting plane algorithm and computational results. 125-145 1996 72 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp72.html#GrotschelMW96a 2005-06-06 The Steiner tree packing problem in VLSI design. 265-281 1997 77 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp78.html#GrotschelMW97 2007-06-14 Facets of the Clique Partitioning Polytope. 367-387 1990 47 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp47.html#GrotschelW90 2004-11-22 A cutting plane algorithm for the windy postman problem. 339-358 1992 55 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp55.html#GrotschelW92 2006-07-20 A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem. 55-84 2006 105 Math. Program. 1 http://dx.doi.org/10.1007/s10107-005-0572-9 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp105.html#GuanANM06 2004-12-06 Optimal objective function approximation for separable convex quadratic programming. 133-142 1994 67 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp67.html#GuderM94 2006-07-20 An optimal adaptive algorithm for the approximation of concave functions. 357-366 2006 107 Math. Program. 3 http://dx.doi.org/10.1007/s10107-003-0502-7 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp107.html#GuerinMS06 2004-12-06 Limiting behavior of weighted central paths in linear programming. 347-363 1994 65 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp65.html#Guler94 2005-01-18 Characterization of the barrier parameter of homogeneous convex cones. 55-76 1998 81 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp81.html#GulerT98 2004-11-29 Convergence behavior of interior-point algorithms. 215-228 1993 60 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp60.html#GulerY93 2005-01-18 Approximability of flow shop scheduling. 175-190 1998 82 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp82.html#Hall98 2006-01-02 The simplest examples where the simplex method cycles and conditions where expand fails to prevent cycling. 133-150 2004 100 Math. Program. 1 http://dx.doi.org/10.1007/s10107-003-0488-1 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp100.html#HallM04 2004-11-29 Towards equitable distribution via proportional equity constraints. 287-294 1993 58 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp58.html#HallV93 2006-01-02 Capacitated transit assignment with loading priorities. 205-230 2004 101 Math. Program. 1 http://dx.doi.org/10.1007/s10107-004-0542-7 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp101.html#HamdouchMN04 2004-12-13 On games corresponding to sequencing situations with ready times. 471-483 1995 69 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp69.html#HamersBT95 2006-09-19 Simple integer recourse models: convexity and convex approximations. 435-473 2006 108 Math. Program. 2-3 http://dx.doi.org/10.1007/s10107-006-0718-4 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp108.html#HaneveldSV07 2004-11-16 Hyperbolic 0-1 programming and query optimization in information retrieval. 255-263 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#HansenAR91 2005-01-18 Cluster analysis and mathematical programming. 191-215 1997 79 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp79.html#HansenJ97 2004-11-16 An analytical approach to global optimization. 227-254 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#HansenJL91 2004-11-22 Global optimization of univariate Lipschitz functions: I. Survey and properties. 251-272 1992 55 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp55.html#HansenJL92 2004-11-22 Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison. 273-292 1992 55 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp55.html#HansenJL92a 2004-11-16 Optimization of pipe networks. 45-58 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#HansenMN91 2004-11-08 Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms and Applications. 161-220 1990 48 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp48.html#HarkerP90 2004-11-08 Newton's Method for the Nonlinear Complementarity Problem: A B-Differentiable Equation Approach. 339-357 1990 48 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp48.html#HarkerX90 2006-07-20 Collusive game solutions via optimization. 407-435 2005 104 Math. Program. 2-3 http://dx.doi.org/10.1007/s10107-005-0622-3 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp104.html#HarringtonHPLR05 2004-11-22 An analogue of Hoffman's circulation conditions for max-balanced flows. 459-476 1992 57 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp57.html#HartmannS92 2006-10-23 ⁿ. 281-283 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#HartmannT91 2006-07-20 A primal all-integer algorithm based on irreducible solutions. 205-246 2003 96 Math. Program. 2 http://dx.doi.org/10.1007/s10107-003-0384-8 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp96.html#HausKW03 2006-07-19 Variable metric bundle methods: From conceptual to implementable forms. 393-410 1996 76 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp76.html#LemarechalS96 2004-11-08 A Spectral Approach to Polyhedral Dimension. 441-459 1990 47 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp47.html#Lee90 2004-12-06 On the solution of a two ball trust region subproblem. 249-276 1994 64 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp64.html#Heinkenschloss94 2004-12-21 SLP-IOR: An interactive model management system for stochastic linear programs. 221-240 1996 75 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp75.html#KallM96 2004-11-10 Numerical evaluation of SBmethod. 381-406 2003 95 Math. Program. 2 http://dx.doi.org/10.1007/s10107-002-0354-6 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp95.html#Helmberg03 2004-11-22 A continuous approach to inductive inference. 215-238 1992 57 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp57.html#KamathKRR92 2006-07-20 On the positive sum property and the computation of Graver test sets. 247-269 2003 96 Math. Program. 2 http://dx.doi.org/10.1007/s10107-003-0385-7 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp96.html#Hemmecke03 2004-11-08 Computation of equilibria in an economy with increasing returns to scale technologies. 253-261 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#Kamiya91 2006-03-29 Value Functions, Domination Cones and Proper Efficiency in Multicriteria Optimization. 205-217 1990 46 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp46.html#Henig90 2005-01-18 Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities. 55-87 1998 83 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp83.html#KanzowF98 2006-03-29 Tradeoff directions in multiobjective optimization problems. 357-374 1997 77 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp78.html#HenigB97 2005-01-18 A continuation method for (strongly) monotone variational inequalities. 103-125 1998 81 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp81.html#KanzowJ98 2006-07-20 Calmness of constraint systems with applications. 437-464 2005 104 Math. Program. 2-3 http://dx.doi.org/10.1007/s10107-005-0623-2 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp104.html#HenrionO05 2004-12-21 Duality theorem for a generalized Fermat-Weber problem. 285-297 1996 76 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp76.html#KaplanY96 2006-01-02 Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints. 589-611 2004 100 Math. Program. 3 http://dx.doi.org/10.1007/s10107-004-0507-x http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp100.html#HenrionR04 2004-12-13 Speeding up Karmarkar's algorithm for multicommodity flows. 111-127 1996 73 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp73.html#KapoorV96 2004-11-08 On the equivalence between strong solvability and strict semimonotonicity for some systems involving Z-functions. 371-379 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#HerreroS91 2005-01-18 Random sampling and greedy sparsification for matroid optimization problems. 41-81 1998 82 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp82.html#Karger98 2005-02-01 A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. 75-88 1995 69 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp69.html#HertogJRT95 2004-12-13 Lower bounds for the quadratic assignment problem via triangle decompositions. 137-151 1995 71 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp71.html#KarischR95 2005-02-01 A survey of search directions in interior point methods for linear programming. 481-509 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#HertogR91 2004-11-16 Computational results of an interior point algorithm for large scale linear programming. 555-586 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#KarmarkarR91 2004-12-16 A Note on an Implementation of a Method for Quadratic Semi-Infinite Programming. 249-254 1990 46 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp46.html#HettichG90 2004-11-16 An interior point algorithm to solve computationally difficult set covering problems. 597-618 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#KarmarkarRR91 2004-12-06 Finite master programs in regularized stochastic decomposition. 143-168 1994 67 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp67.html#HigleS94 2004-12-06 Minimum cost multiflows in undirected networks. 313-325 1994 66 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp66.html#Karzanov94 2004-12-21 Duality and statistical tests of optimality for two stage stochastic programs. 257-275 1996 75 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp75.html#HigleS96 2005-01-18 Linear programming, the simplex algorithm and simple polytopes. 217-233 1997 79 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp79.html#Kalai97 2004-12-13 A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines. 17-32 1996 72 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp72.html#Li96 2006-01-02 A mesh-independence result for semismooth Newton methods. 151-184 2004 101 Math. Program. 1 http://dx.doi.org/10.1007/s10107-004-0540-9 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp101.html#HintermullerU04 2004-11-08 Karmarkar's Algorithm with Improved Steps. 73-78 1990 46 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp46.html#Kalantari90 2005-11-16 On min-norm and min-max methods of multi-objective optimization. 1-33 2005 103 Math. Program. 1 http://dx.doi.org/10.1007/s10107-003-0462-y http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp103.html#Lin05 2005-01-18 Stability for linearly constrained optimization problems. 351-360 1994 66 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp66.html#HirabayashiJS94 2004-12-21 Multiflows and disjoint paths of minimum total cost. 219-242 1997 77 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp78.html#Karzanov97 2006-01-02 Spatial oligopolistic equilibria with arbitrage, shared resources, and price function conjectures. 57-94 2004 101 Math. Program. 1 http://dx.doi.org/10.1007/s10107-004-0537-4 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp101.html#HobbsP04 2004-11-29 Cyclical games with prohibitions. 277-293 1993 60 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp60.html#KarzanovL93 2004-12-13 About strongly polynomial time algorithms for quadratic optimization over submodular constraints. 269-309 1995 69 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp69.html#HochbaumH95 2006-07-20 <i>NK</i>model. 319-338 2006 106 Math. Program. 2 http://dx.doi.org/10.1007/s10107-005-0609-0 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp106.html#KaulJ06 2004-11-29 Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. 69-83 1993 62 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp62.html#HochbaumMNT93 2006-09-19 <i>NK</i>model: handling dependency. 475-494 2006 108 Math. Program. 2-3 http://dx.doi.org/10.1007/s10107-006-0719-3 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp108.html#KaulJ07 2004-11-22 A polynomial algorithm for an integer quadratic non-separable transportation problem. 359-371 1992 55 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp55.html#HochbaumSS92 2004-11-08 Second order necessary optimality conditions for minimizing a sup-type function. 213-229 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#Kawasaki91 2004-11-29 Staircase transportation problems with superadditive rewards and cumulative capacities. 199-213 1993 62 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp62.html#HoffmanV93 2004-11-16 Uneven distribution of ventilation-perfusion ratios in lungs estimated by a modified Newton method. 1-9 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#KawashiroYOKT91 2004-11-08 On the Convergence of Cross Decomposition. 269-296 1990 47 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp47.html#Holmberg90 2005-01-18 On proving existence of feasible points in equality constrained optimization problems. 89-100 1998 83 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp83.html#Kearfott98 2004-12-13 A note on the strong polynomiality of convex quadratic programming. 131-139 1995 68 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp68.html#HongV95 2004-11-08 Approximate Quasi-Newton Methods. 41-70 1990 48 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp48.html#KelleyS90 2005-07-01 Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine. 273-289 1998 82 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp82.html#HoogeveenV98 2004-11-16 Sequential quadratic programming for certain parameter identification problems. 281-305 1991 51 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp51.html#KelleyW91 2004-12-21 Resolution and the integrality of satisfiability problems. 1-10 1996 74 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp74.html#Hooker96 2004-11-08 CP-Rays in Simplicial Cones. 387-414 1990 48 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp48.html#KellyMW90 2004-11-16 Concave minimization via conical partitions and polyhedral outer approximation. 259-274 1991 50 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp50.html#HorstTB91 2006-01-02 Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs. 517-535 2004 100 Math. Program. 3 http://dx.doi.org/10.1007/s10107-004-0503-1 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp100.html#KesavanAGB04 2006-07-20 Gomory integer programs. 271-292 2003 96 Math. Program. 2 http://dx.doi.org/10.1007/s10107-003-0386-6 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp96.html#HostenT03 2004-11-29 Constraint qualifications in quasidifferentiable optimization. 339-347 1993 60 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp60.html#KuntzS93 2004-11-08 A One-Phase Algorithm for Semi-Infinite Linear Programming. 85-103 1990 46 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp46.html#Hu90 2004-11-29 On the complexity of approximating the maximal inscribed ellipsoid for a polytope. 137-159 1993 61 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp61.html#KhachiyanT93 2004-12-06 Second-order necessary and sufficient conditions in nonsmooth optimization. 379-402 1994 66 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp66.html#HuangN94 2004-12-21 Fractional and integral colourings. 333-347 1996 76 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp76.html#KilakosM96 2006-01-02 <i>P</i>_<i>0</i>- and monotone LCP. 423-441 2004 99 Math. Program. 3 http://dx.doi.org/10.1007/s10107-003-0457-8 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp99.html#HuangQS04 2004-11-16 Convergence of a generalized subgradient method for nondifferentiable convex optimization. 75-80 1991 50 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp50.html#KimA91 2004-12-21 Two generalizations of Dykstra's cyclic projections algorithm. 335-355 1997 77 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp77.html#HundalD97 2004-11-08 Variable target value subgradient method. 359-369 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#KimAC91 2004-12-06 The rectilinear class Steiner tree problem for intervals on two parallel lines. 281-296 1994 63 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp63.html#Ihler94 2004-12-13 A descent method with linear programming subproblems for nondifferentiable convex optimization. 17-28 1995 71 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp71.html#KimCL95 2004-12-13 Ideal polytopes and face structures of some combinatorial optimization problems. 1-15 1995 71 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp71.html#IkebeT95 2004-11-22 Sensitivity analysis for nonsmooth generalized equations. 193-212 1992 55 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp55.html#KingR92 2004-12-21 Cut sharing for multistage stochastic linear programs with interstage dependency. 241-256 1996 75 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp75.html#InfangerM96 2005-11-16 A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. 515-539 2005 103 Math. Program. 3 http://dx.doi.org/10.1007/s10107-004-0551-6 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp103.html#Kis05 2004-11-08 Recession cones and the domination property in vector optimization. 113-122 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#Luc91 2004-11-29 A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints. 137-145 1993 58 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp58.html#Ioffe93 2004-11-08 Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization. 105-122 1990 46 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp46.html#Kiwiel90 2006-07-20 Typical convex program is very well posed. 483-499 2005 104 Math. Program. 2-3 http://dx.doi.org/10.1007/s10107-005-0625-0 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp104.html#IoffeL05 2004-11-08 Solution Differentiability for Variational Inequalities. 285-301 1990 48 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp48.html#Kyparisis90 2004-11-22 Local convergence of quasi-Newton methods for B-differentiable equations. 71-89 1992 56 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp56.html#IpK92 2004-11-22 Solution behavior for parametric implicit complementarity problems. 65-70 1992 56 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp56.html#KyparisisI92 2004-11-16 Integrability of vector and multivector fields associated with interior point methods for linear programming. 511-525 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#Iri91 2004-11-16 Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. 285-302 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#Kiwiel91 2004-11-29 On the big Mu in the affine scaling algorithm. 85-93 1993 62 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp62.html#IshiharaK93 2004-12-13 Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. 89-109 1995 69 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp69.html#Kiwiel95 2004-11-08 The Augmented Lagrangian Method for Equality and Inequality Constraints in Hilbert Spaces. 341-360 1990 46 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp46.html#ItoK90 2004-12-21 Complexity of some cutting plane methods that use analytic centers. 47-54 1996 74 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp74.html#Kiwiel96 2004-11-29 On the convergence of iterative methods for symmetric linear complementarity problems. 33-48 1993 59 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp59.html#Iusem93 2004-12-06 Relaxation-based algorithms for minimax optimization problems with resource allocation applications. 337-363 1994 64 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp64.html#KleinLR94 2004-11-08 On the Convergence Properties of Hildreth's Quadratic Programming Algorithm. 37-51 1990 47 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp47.html#IusemP90 2004-11-22 A lexicographic minimax algorithm for multiperiod resource allocation. 213-234 1992 55 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp55.html#KleinLS92 2004-11-16 On the convergence of Han's method for convex programming with quadratic objective. 265-284 1991 52 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp52.html#IusemP91 2004-12-13 A strongly polynomial algorithm for the transportation problem. 1-13 1995 68 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp68.html#KleinschmidtS95 2006-07-20 On pairs of vectors achieving the maximal angle of a convex cone. 501-523 2005 104 Math. Program. 2-3 http://dx.doi.org/10.1007/s10107-005-0626-z http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp104.html#IusemS05 2006-01-03 Optimization problems with equilibrium constraints and their numerical solution. 119-149 2004 101 Math. Program. 1 http://dx.doi.org/10.1007/s10107-004-0539-2 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp101.html#KocvaraO04 2005-11-16 A row-action method for convex programming. 149-171 1994 64 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp64.html#IusemS94 2005-11-16 Variance reduction in sample approximations of stochastic programs. 463-485 2005 103 Math. Program. 3 http://dx.doi.org/10.1007/s10107-004-0557-0 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp103.html#Koivu05 2004-12-21 A capacity scaling algorithm for convex cost submodular flows. 299-308 1996 76 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp76.html#Iwata96 2005-11-16 Sparsity in sums of squares of polynomials. 45-62 2005 103 Math. Program. 1 http://dx.doi.org/10.1007/s10107-004-0554-3 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp103.html#KojimaKW05 2005-11-16 A capacity scaling algorithm for M-convex submodular flow. 181-202 2005 103 Math. Program. 1 http://dx.doi.org/10.1007/s10107-004-0562-3 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp103.html#IwataMM05 2004-11-29 Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. 1-21 1993 59 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp59.html#KojimaMM93 2004-11-10 Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods. 631-650 2003 95 Math. Program. 3 http://dx.doi.org/10.1007/s10107-002-0346-6 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp95.html#IzmailovS03 2004-11-29 A primal-dual infeasible-interior-point algorithm for linear programming. 263-280 1993 61 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp61.html#KojimaMM93a 2006-03-29 Guidelines for reporting results of computational experiments. Report of the ad hoc committee. 413-425 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#JacksonBNP91 2004-11-08 Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem. 415-435 1990 48 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp48.html#KojimaMY90 2005-11-16 A global optimization method for the molecular replacement problem in X-ray crystallography. 399-426 2005 103 Math. Program. 2 http://dx.doi.org/10.1007/s10107-005-0587-2 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp103.html#JamrogPTZ05 2004-11-16 An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. 331-342 1991 50 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp50.html#KojimaMY91 2006-07-20 An approximation algorithm for the general max-min resource sharing problem. 547-566 2006 106 Math. Program. 3 http://dx.doi.org/10.1007/s10107-005-0669-1 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp106.html#Jansen06 2004-11-22 An interior point potential reduction algorithm for the linear complementarity problem. 267-279 1992 54 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp54.html#KojimaMY92 2004-11-10 Computing optimal preemptive schedules for parallel tasks: linear programming approaches. 617-630 2003 95 Math. Program. 3 http://dx.doi.org/10.1007/s10107-002-0361-7 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp95.html#JansenP03 2004-11-29 A little theorem of the big Mu in interior point algorithms. 361-375 1993 59 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp59.html#KojimaMY93 2004-12-21 Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. 117-130 1996 76 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp76.html#JansenRTY96 2004-12-06 Global convergence in infeasible-interior-point algorithms. 43-72 1994 65 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp65.html#KojimaNY94 2004-12-21 Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. 315-345 1997 77 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp78.html#JansenRTY97 2005-01-18 Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. 129-160 1998 80 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp80.html#KojimaSS98 2004-12-13 On the convergence of the method of analytic centers when applied to convex quadratic programs. 341-358 1991 49 Math. Program. http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp49.html#Jarre91 2006-01-02 Approximating disjoint-path problems using packing integer programs. 63-87 2004 99 Math. Program. 1 http://dx.doi.org/10.1007/s10107-002-0370-6 http://www.informatik.uni-trier.de/~ley/db/journals/mp/mp99.html#KolliopoulosS04