Country: Germany

Found 3096 papers in total
Q-superlinear convergence of the iterates in primal–dual interior-point methods
Q-superlinear convergence of the iterates in primal–dual interior-point methods
2001,
Sufficient conditions are given for the Q-superlinear convergence of the iterates...
Dual bounding procedures lead to convergent branch-and-bound algorithms
Dual bounding procedures lead to convergent branch-and-bound algorithms
2001,
Branch-and-Bound methods with dual bounding procedures have recently been used to...
Perfect duality in semi-infinite and semidefinite programming
Perfect duality in semi-infinite and semidefinite programming
2001,
This paper develops new relationships between the recently constructed semidefinite...
Benchmarking optimization software with performance profiles
Benchmarking optimization software with performance profiles
2002,
We propose performance profiles – distribution functions for a performance...
Wedge trust region methods for derivative free optimization
Wedge trust region methods for derivative free optimization
2002,
A new method for derivative-free optimization is presented. It is designed for solving...
A branch and cut approach to the cardinality constrained circuit problem
A branch and cut approach to the cardinality constrained circuit problem
2002,
The Cardinality Constrained Circuit Problem (CCCP) is the problem of finding a minimum...
On convergence of the Gauss–Newton method for convex composite optimization
On convergence of the Gauss–Newton method for convex composite optimization
2002,
The local quadratic convergence of the Gauss–Newton method for convex composite...
On the rank of mixed 0,1 polyhedra
On the rank of mixed 0,1 polyhedra
2002,
For a polytope in the [0,1] n cube, Eisenbrand and Schulz showed recently that the...
The primal–dual method for approximation algorithms
The primal–dual method for approximation algorithms
2002,
In this survey, we give an overview of a technique used to design and analyze...
Matching, matroids, and extensions
Matching, matroids, and extensions
2002,
Perhaps the two most fundamental well-solved models in combinatorial optimization are...
Objective-derivative-free methods for constrained optimization
Objective-derivative-free methods for constrained optimization
2002,
We propose feasible descent methods for constrained minimization that do not make...
A new inexact alternating directions method for monotone variational inequalities
A new inexact alternating directions method for monotone variational inequalities
2002,
The alternating directions method (ADM) is an effective method for solving a class of...
Convex composite non-Lipschitz programming
Convex composite non-Lipschitz programming
2002,
In this paper necessary and sufficient optimality conditions are established without...
Optimality conditions in non-convex set-valued optimization
Optimality conditions in non-convex set-valued optimization
2001,
The notion of radial epiderivative is introduced and then a necessary and sufficient...
Optimal volume subintervals with k points and star discrepancy via integer programming
Optimal volume subintervals with k points and star discrepancy via integer programming
2001,
Given n points in the s -dimensional unit cube, we consider the problem of finding a...
An optimal bound for d.c. programs with convex constraints
An optimal bound for d.c. programs with convex constraints
2001,
A well-known strategy for obtaining a lower bound on the minimum of a d.c. function f...
On the existence and connectedness of solution sets of vector variational inequalities
On the existence and connectedness of solution sets of vector variational inequalities
2001,
In this paper, we consider a more general form of weak vector variational inequalities...
Newton methods for solving nonsmooth equations via a new subdifferential
Newton methods for solving nonsmooth equations via a new subdifferential
2001,
A new subdifferential for a locally Lipschitzian function is proposed. Based on this...
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
Convergence and first hitting time of simulated annealing algorithms for continuous global optimization
2001,
In this paper simulated annealing algorithms for continuous global optimization are...
Box-inequalities for quadratic assignment polytopes
Box-inequalities for quadratic assignment polytopes
2001,
Linear Programming based lower bounds have been considered both for the general as...
Minimizing the span of d-walks to compute optimum frequency assignments
Minimizing the span of d-walks to compute optimum frequency assignments
2002,
In this paper we deal with the Minimum Span Frequency Assignment Problem (MSFAP), that...
Solving large quadratic assignment problems on computational grids
Solving large quadratic assignment problems on computational grids
2002,
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization...
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
2002,
We present a randomized procedure for rounding fractional perfect matchings to...
Entropic proximal decomposition methods for convex programs and variational inequalities
Entropic proximal decomposition methods for convex programs and variational inequalities
2001,
We consider convex optimization and variational inequality problems with a given...
Papers per page: