Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Mathematical Programming
Found
797 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On Q-matrices
1990,
Gowda Seetharama M.
Recently, Jeter and Pye gave an example to show that Pang’s conjecture, that L 1...
Guidelines for reporting results of computational experiments. Report of the ad hoc committee
1991,
Nash Stephen G.
This report on guidelines for reporting results of computational experiments is...
Recession cones and the domination property in vector optimization
1990,
Dinh The Luc
This paper presents a study of recession cones of nonconvex sets in infinite...
A topological characterization for closed sets under polar duality in
1990,
Trotter L.E.
A topological characterization is given for closed sets in under the restriction of...
Capacitated, balanced, sequential location-allocation problems on chains and trees
1991,
Sherali Hanif D.
This paper considers finite horizon, multiperiod, sequential, minisum...
Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
1990,
Ariyawansa K.A.
This paper is concerned with collinear scaling algorithms for unconstrained...
Implicit functions and sensitivity of stationary points
1990,
Tammer K.
The authors consider the space L(D ) consisting of Lipschitz continuous mappings from...
A trust region algorithm for equality constrained optimization
1990,
Yuan Y.
A trust region algorithm for equality constrained optimization is proposed that...
Second order necessary optimality conditions for minimizing a sup-type function
1990,
Kawasaki H.
The second derivative of an envelope cannot be expressed only by second derivatives of...
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
1990,
Fukushima Masao
This paper presents an algorithm for solving nonlinear programming problems where the...
Quasidifferentials and maximal normal operators
1990,
Qi Liqun
Quasidifferentials are studied with the theory of maximal normal operators. The...
On superlinear convergence in univariate nonsmooth minimization
1990,
Mifflin Robert
This note demonstrates a new result on superlinear convergence in nonsmooth univariate...
An analysis of reduced Hessian methods for constrained optimization
1991,
Byrd Richard H.
The authors study the convergence properties of reduced Hessian successive quadratic...
Variable target value subgradient method
1991,
Kim Sehun
Polyak’s subgradient algorithm for nondifferentiable optimization problems...
Optimizing over the subtour polytope of the travelling salesman problem
1990,
Pulleyblank W.R.
A commonly studied relaxation of the travelling salesman problem is obtained by adding...
An O(n3L) primal interior point algorithm for convex quadratic programming
1991,
Goldfarb D.
The paper presents a primal interior point method for convex quadratic programming...
On the convergence of the method of analytic centers when applied to convex quadratic programs
1991,
Jarre F.
This work examines the method of analytic centers of Sonnevend when applied to solve...
An analytical comparison of different formulations of the travelling salesman problem
1991,
Padberg Manfred
A transformation technique is proposed that permits one to derive the linear...
An analytical approach to global optimization
1991,
Hansen Pierre
Global optimization problems with a few variables and constraints arise in numerous...
On the convergence of Han’s method for convex programming with quadratic objective
1991,
Iusum Alfredo N.
The authors present an iterative method for minimizing strictly convex quadratic...
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
1991,
Kiwiel Krzysztof C.
This paper presents new versions of proximal bundle methods for solving convex...
Hyperbolic 0-1 programming and query optimization in information retrieval
1991,
Hansen Pierre
Unconstrained hyperbolic 0-1 programming can be solved in linear time when the...
Lagrangean decomposition for integer nonlinear programming with linear constraints
1991,
Maculan Nelson
The authors present a Lagrangean decomposition to study integer nonlinear programming...
Interior point algorithms for linear programming with inequality constraints
1991,
Gonzaga Clovis C.
Interior methods for linear programming were designed mainly for problems formulated...
First Page
28
29
30
31
32
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers