Country: Netherlands

Found 18376 papers in total
New variants of the criss-cross method for linearly constrained convex quadratic programming
New variants of the criss-cross method for linearly constrained convex quadratic programming
2004,
In this paper, S. Zhang's new and more flexible criss-cross type algorithms (with LIFO...
On stages and consistency checks in stochastic programming
On stages and consistency checks in stochastic programming
2005,
This paper gives a rigorous definition of a stage, usable for dynamic stochastic...
On the convergence of the block linear Gauss–Seidel method under convex constraints
On the convergence of the block linear Gauss–Seidel method under convex constraints
2000,
We give new convergence results for the block Gauss–Seidel method for problems...
Existence of a solution to nonlinear variational inequality under generalized positive homogeneity
Existence of a solution to nonlinear variational inequality under generalized positive homogeneity
1999,
We establish several new existence theorems for nonlinear variational inequalities...
Solving the semismooth equivalence problem
Solving the semismooth equivalence problem
2004,
This paper presents a special semismooth system of equations and a suitable...
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
2004,
A form p on ℝ n (homogeneous n -variate polynomial) is called positive...
On the relation between 𝒰-Hessian and second-order epi-derivatives
On the relation between 𝒰-Hessian and second-order epi-derivatives
2004,
We consider second-order objects for a convex function defined as the maximum of a...
Linear semi-openness and the Lyusternik theorem
Linear semi-openness and the Lyusternik theorem
2004,
A class of set-valued mappings called linearly semi-open mappings is introduced which...
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
2004,
We consider a generalized semi-infinite programming problem (GSIP) with one...
ϵ-optimality for multiobjective programming on a Banach space
ϵ-optimality for multiobjective programming on a Banach space
2004,
We establish a Langrange multiplier rule, in terms of Clarke generalized gradient,...
Continuity of minimal points with applications to parametric multiple objective optimization
Continuity of minimal points with applications to parametric multiple objective optimization
2004,
Basing ourselves on general results we investigate stability of Pareto points to...
Stochastic mathematical programs with equilibrium constraints
Stochastic mathematical programs with equilibrium constraints
1999,
We introduce stochastic mathematical programs with equilibrium constraints (SMPEC),...
Relationships between vector variational-like inequality and optimization problems
Relationships between vector variational-like inequality and optimization problems
2004,
In this paper we will establish the relationships between vector variational-like...
An exact solution method for reliability optimization in complex systems
An exact solution method for reliability optimization in complex systems
2005,
Systems reliability plays an important part in systems design, operation and...
A relaxed approximate proximal point algorithm
A relaxed approximate proximal point algorithm
2005,
For a maximal monotone operator T , a well-known overrelaxed point algorithm is often...
Smoothing trust region methods for nonlinear complementarity problems with P0-functions
Smoothing trust region methods for nonlinear complementarity problems with P0-functions
2005,
By using the Fischer–Burmeister function to reformulate the nonlinear...
A unified class of directly solvable semidefinite programming problems
A unified class of directly solvable semidefinite programming problems
2005,
We propose a class of semidefinite programming (SDP) problems for which an optimal...
A modified relaxation scheme for mathematical programs with complementarity constraints
A modified relaxation scheme for mathematical programs with complementarity constraints
2005,
In this paper, we consider a mathematical program with complementarity constraints. We...
Parameter-free dual models for fractional programming with generalized invexity
Parameter-free dual models for fractional programming with generalized invexity
2005,
By parameter-free approach, we establish sufficient optimality conditions for...
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
2005,
The DC programming and its DC algorithm (DCA) address the problem of minimizing a...
Linear programming with variable matrix entries
Linear programming with variable matrix entries
2005,
We consider linear programming (continuous or integer) where some matrix entries are...
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
2000,
While properties of the weighted central path for linear and non-linear programs have...
Forward chaining is simple (x)
Forward chaining is simple (x)
2000,
We show that Forward Chaining in Horn Systems is merely the Simplex Algorithm,...
Computational results with a primal–dual subproblem simplex method
Computational results with a primal–dual subproblem simplex method
1999,
The two main ideas implemented are a primal–dual subproblem simplex method and a...
Papers per page: