Country: United States

Found 17049 papers in total
Sharp results on convergence rates for the distribution of GI/M/1/K queues as K tends to infinity
Sharp results on convergence rates for the distribution of GI/M/1/K queues as K tends to infinity
2000,
In this paper, we investigate how fast the stationary distribution π (K) of an...
The stable allocation (or ordinal transportation) problem
The stable allocation (or ordinal transportation) problem
2002,
The stable allocation problem generalized the 0,1 stable matching problems...
The distribution of values in the quadratic assignment problem
The distribution of values in the quadratic assignment problem
2003,
We obtain a number of results regarding the distribution of values of a quadratic...
Quantitative stability in stochastic programming: The method of probability metrics
Quantitative stability in stochastic programming: The method of probability metrics
2002,
Quantitative stability of optimal values and solution sets to stochastic programming...
On the Glivenko–Cantelli problem in stochastic programming: Linear recourse and extensions
On the Glivenko–Cantelli problem in stochastic programming: Linear recourse and extensions
1998,
Integrals of optimal values of random optimization problems depending on a finite...
A superlinearly convergent algorithm for the monotone nonlinear complementarity problem without uniqueness and nondegeneracy conditions
A superlinearly convergent algorithm for the monotone nonlinear complementarity problem without uniqueness and nondegeneracy conditions
2002,
The purpose of this paper is to present an algorithm for solving the monotone...
The theory of 2–regularity for mappings with Lispschitzian derivatives and its applications to optimality conditions
The theory of 2–regularity for mappings with Lispschitzian derivatives and its applications to optimality conditions
2002,
We study local structure of a nonlinear mapping near points where standard regularity...
Properties of the log-barrier function on degenerate nonlinear programs
Properties of the log-barrier function on degenerate nonlinear programs
2002,
We examine the sequence of local minimizers of the log-barrier function for a...
Approximating subdifferentials by random sampling of gradients
Approximating subdifferentials by random sampling of gradients
2002,
Many interesting real functions on Euclidean space are differential almost everywhere....
On lower bounds of the second-order directional derivatives of Ben-Tal, Zowe and Chaney
On lower bounds of the second-order directional derivatives of Ben-Tal, Zowe and Chaney
1997,
Let f be a regular, locally Lipschitz real-valued function defined on an open convex...
Robust control via sequential semidefinite programming
Robust control via sequential semidefinite programming
2002,
This paper discusses nonlinear optimization techniques in robust control synthesis,...
Alpha-convex sets and strong quasiconvexity
Alpha-convex sets and strong quasiconvexity
1997,
A major property of continuous strong convex functions is that they are inf-compact;...
Necessary optimality conditions for optimization problems with variational inequality constraints
Necessary optimality conditions for optimization problems with variational inequality constraints
1997,
In this paper we study optimization problems with variational inequality constraints...
Averaging schemes for variational inequalities and systems of equations
Averaging schemes for variational inequalities and systems of equations
1997,
We study averaging methods for solving variational inequalities whose underlying maps...
Free-steering relaxation methods for problems with strictly convex costs and linear constraints
Free-steering relaxation methods for problems with strictly convex costs and linear constraints
1997,
We consider dual coordinate ascent methods for minimizing a strictly convex (possibily...
Semismooth Karush–Kuhn–Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations
Semismooth Karush–Kuhn–Tucker equations and convergence analysis of Newton and quasi-Newton methods for solving these equations
1997,
There are several forms of systems of nonsmooth equations which are equivalent to the...
Linear programming formulation for optimal stopping problems
Linear programming formulation for optimal stopping problems
2002,
Optimal stopping problems for continuous time Markov processes are shown to be...
Stability in the discretization of a parametric semi-infinite convex inequality system
Stability in the discretization of a parametric semi-infinite convex inequality system
2002,
In this paper, we consider a parametric family of convex inequality systems in the...
Shadow prices in infinite-dimensional linear programming
Shadow prices in infinite-dimensional linear programming
1998,
We consider the class of linear programs that can be formulated with infinitely many...
On two interior-point mappings for nonlinear semidefinite complementarity problems
On two interior-point mappings for nonlinear semidefinite complementarity problems
1998,
Extending our previous work, this paper studies properties of two fundamental mappings...
Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
1998,
We develop a long-step polynomial time version of the Method of Analytic Centers for...
Centers of monotone generalized complementarity problems
Centers of monotone generalized complementarity problems
1997,
Let C be a full dimensional, closed, pointed and convex cone in a finite dimensional...
On the complexity of solving sparse symmetric linear programs specified with approximate data
On the complexity of solving sparse symmetric linear programs specified with approximate data
1997,
An algorithm that solves symmetric linear programs specified with approximate data is...
Colourful linear programming and its relatives
Colourful linear programming and its relatives
1997,
We consider the following Colourful generalization of Linear Programming: given sets...
Papers per page: