Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Math Program Ser A

Search In Journal Title:

Abbravation: Mathematical Programming

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1002/bjs.4663

Search In DOI:

ISSN

1436-4646

Search In ISSN:
Search In Title Of Papers:

Analysis of infeasibleinteriorpoint paths arisin

Authors: Martin Preiß Josef Stoer
Publish Date: 2003/08/18
Volume: 99, Issue: 3, Pages: 499-520
PDF Link

Abstract

We consider semidefinite monotone linear complementarity problems SDLCP in the space n of real symmetric n×nmatrices equipped with the cone n + of all symmetric positive semidefinite matrices One may define weighted using any M∈ n ++ as weight infeasible interior point paths by replacing the standard condition XY=rI r0 that defines the usual central path by XY+YX/2=rM Under some mild assumptions the most stringent is the existence of some strictly complementary solution of SDLCP these paths have a limit as r↓0 and they depend analytically on all path parameters such as r and M even at the limit point r=0

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. Submodular maximization meets streaming: matchings, matroids, and more
  2. Some computationally relevant group theoretic structures of fixed charge problems
  3. Applications of convex analysis within mathematics
  4. Large-scale semidefinite programs in electronic structure calculation
  5. A distributionally robust perspective on uncertainty quantification and chance constrained programming
  6. The factorization approach to large-scale linear programming
  7. Beyond symmetric Broyden for updating quadratic models in minimization without derivatives
  8. A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
  9. Breakpoint searching algorithms for the continuous quadratic knapsack problem
  10. Sandwich games
  11. Approximations of Nash equilibria
  12. Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
  13. A robust and efficient method for solving point distance problems by homotopy
  14. A nonmonotone GRASP
  15. Extreme point inequalities and geometry of the rank sparsity ball
  16. Primal-dual interior-point methods for PDE-constrained optimization
  17. A new branch-and-cut algorithm for the capacitated vehicle routing problem
  18. Single item lot-sizing with non-decreasing capacities
  19. Structural and algorithmic properties for parametric minimum cuts
  20. Simple integer recourse models: convexity and convex approximations
  21. A model of the coNP-complete non-Hamilton tour decision problem for directed graphs
  22. Iteration complexity analysis of block coordinate descent methods
  23. Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems
  24. Accelerating the cubic regularization of Newton’s method on convex problems
  25. Bundle methods for sum-functions with “easy” components: applications to multicommodity network design
  26. On the number of solutions to the linear comple-mentarity problem
  27. Time-consistent approximations of risk-averse multistage stochastic optimization problems
  28. PEBBL: an object-oriented framework for scalable parallel branch and bound
  29. PEBBL: an object-oriented framework for scalable parallel branch and bound
  30. The capacitated max k -cut problem
  31. Critical extreme points of the 2-edge connected spanning subgraph polytope
  32. Nash equilibria in the two-player kidney exchange game
  33. On some properties and an application of the logarithmic barrier method
  34. Complementarity systems in optimization
  35. On the exact separation of mixed integer knapsack cuts
Search Result: