Journal: Optimization Letters

Found 309 papers in total
A new greedy algorithm for the quadratic assignment problem
A new greedy algorithm for the quadratic assignment problem
2013,
The classical greedy algorithm for discrete optimization problems where the optimal...
Optimality conditions in convex optimization revisited
Optimality conditions in convex optimization revisited
2013,
The phrase convex optimization refers to the minimization of a convex function over a...
Resource pricing games on graphs: existence of Nash equilibria
Resource pricing games on graphs: existence of Nash equilibria
2013,
In this letter, we consider a non‐cooperative resource pricing game on a graph...
A novel hybrid genetic algorithm for solving Sudoku puzzles
A novel hybrid genetic algorithm for solving Sudoku puzzles
2013,
In this article, a novel hybrid genetic algorithm is proposed. The selection operator,...
On the stability the least squares Monte Carlo
On the stability the least squares Monte Carlo
2013,
Consider least squares Monte Carlo (LSM) algorithm, which is proposed by Longstaff and...
An iterative algorithm for a general system of variational inequalities and fixed point problems in q‐uniformly smooth Banach spaces
An iterative algorithm for a general system of variational inequalities and fixed point problems in q‐uniformly smooth Banach spaces
2013,
In this paper, we introduce a new iterative algorithm for finding a common element of...
Finding cliques of maximum weight on a generalization of permutation graphs
Finding cliques of maximum weight on a generalization of permutation graphs
2013,
We propose a dynamic programming procedure for computing the clique of maximum weight...
An exact penalty global optimization approach for mixed‐integer programming problems
An exact penalty global optimization approach for mixed‐integer programming problems
2013,
In this work, we propose a global optimization approach for mixed‐integer...
Strong convergence of a proximal point algorithm with bounded error sequence
Strong convergence of a proximal point algorithm with bounded error sequence
2013,
Given any maximal monotone operator A : D ( A ) ⊂ H → 2 H in a real Hilbert space H...
A new method for ranking non‐extreme efficient units in data envelopment analysis
A new method for ranking non‐extreme efficient units in data envelopment analysis
2013,
Data envelopment analysis (DEA) evaluates the performance of decision making units...
Efficient model for interval goal programming with arbitrary penalty function
Efficient model for interval goal programming with arbitrary penalty function
2013,
Penalty function is a key factor in interval goal programming (IGP), especially for...
Levitin–Polyak well‐posedness by perturbations of inverse variational inequalities
Levitin–Polyak well‐posedness by perturbations of inverse variational inequalities
2013,
The purpose of this paper is to investigate Levitin–Polyak type...
Calmness and inverse image characterizations for Asplund spaces
Calmness and inverse image characterizations for Asplund spaces
2013,
We establish new characterizations of Asplund spaces in terms of conditions ensuring...
Symmetry‐breaking constraints for packing identical rectangles within polyhedra
Symmetry‐breaking constraints for packing identical rectangles within polyhedra
2013,
Two problems related to packing identical rectangles within a polyhedron are tackled...
Optimal solutions for the double row layout problem
Optimal solutions for the double row layout problem
2013,
The double row layout problem is how to allocate a given set of n machines on both...
Global minimization of non‐smooth unconstrained problems with filled function
Global minimization of non‐smooth unconstrained problems with filled function
2013,
For smooth or non‐smooth unconstrained global optimization problems, an one...
Efficient use of parallelism in algorithmic parameter optimization applications
Efficient use of parallelism in algorithmic parameter optimization applications
2013,
In the context of algorithmic parameter optimization, there is much room for efficient...
Explicit solution for a vector‐valued LQG homing problem
Explicit solution for a vector‐valued LQG homing problem
2013,
In this note, a vector‐valued LQG homing problem subject to a controlled...
On the convergence of an inexact Gauss–Newton trust‐region method for nonlinear least‐squares problems with simple bounds
On the convergence of an inexact Gauss–Newton trust‐region method for nonlinear least‐squares problems with simple bounds
2013,
We introduce an inexact Gauss–Newton trust‐region method for solving...
An improved bit parallel exact maximum clique algorithm
An improved bit parallel exact maximum clique algorithm
2013,
This paper describes new improvements for BB‐MaxClique (San Segundo et al.,...
A new class of smoothing functions and a smoothing Newton method for complementarity problems
A new class of smoothing functions and a smoothing Newton method for complementarity problems
2013,
In this paper, we introduce a new class of smoothing functions, which include some...
Duality and Farkas‐type results for extended Ky Fan inequalities with DC functions
Duality and Farkas‐type results for extended Ky Fan inequalities with DC functions
2013,
In this paper, we deal with extended Ky Fan inequalities (EKFI) with DC functions....
Preserving maximal monotonicity with applications in sum and composition rules
Preserving maximal monotonicity with applications in sum and composition rules
2013,
In this paper, we study maximal monotonicity preserving mappings on the Banach space X...
A note on quadratic convergence of a smoothing Newton algorithm for the LCP
A note on quadratic convergence of a smoothing Newton algorithm for the LCP
2013,
The linear complementarity problem (LCP) is to find ( x , s ) ∈ R n × R n such that (...
Papers per page: