Journal: Journal of Global Optimization

Found 560 papers in total
A primal‐dual prediction‐correction algorithm for saddle point optimization
A primal‐dual prediction‐correction algorithm for saddle point optimization
2016,
In this paper, we introduce a new primal–dual prediction–correction...
The Lyapunov rank of extended second order cones
The Lyapunov rank of extended second order cones
2016,
In this paper, we investigate the structure of Lyapunov‐like transformations on...
Quasi-phi-functions and optimal packing of ellipses
Quasi-phi-functions and optimal packing of ellipses
2016,
We further develop our phi‐function technique for solving Cutting and Packing...
Dynamic programming approximation algorithms for the capacitated lot-sizing problem
Dynamic programming approximation algorithms for the capacitated lot-sizing problem
2016,
This paper provides a new idea for approximating the inventory cost function to be...
Heuristics for exact nonnegative matrix factorization
Heuristics for exact nonnegative matrix factorization
2016,
The exact nonnegative matrix factorization (exact NMF) problem is the following: given...
Extended reverse-convex programming: an approximate enumeration approach to global optimization
Extended reverse-convex programming: an approximate enumeration approach to global optimization
2016,
A new approach to solving a large class of factorable nonlinear programming (NLP)...
Irregular polyomino tiling via integer programming with application in phased array antenna design
Irregular polyomino tiling via integer programming with application in phased array antenna design
2016,
A polyomino is a generalization of the domino and is created by connecting a fixed...
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
2016,
We propose a hierarchy of semidefinite programming (SDP) relaxations for polynomial...
Numerical approximation of the solution in infinite dimensional global optimization using a representation formula
Numerical approximation of the solution in infinite dimensional global optimization using a representation formula
2016,
A non convex optimization problem, involving a regular functional J , on a closed and...
Global optimization with spline constraints: a new branch-and-bound method based on B-splines
Global optimization with spline constraints: a new branch-and-bound method based on B-splines
2016,
This paper discusses the use of splines as constraints in mathematical programming. By...
Post factum analysis for robust multiple criteria ranking and sorting
Post factum analysis for robust multiple criteria ranking and sorting
2016,
Providing partial preference information for multiple criteria ranking or sorting...
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
2016,
Given a graph G , we study the problem of finding the minimum number of colors...
On Slater’s condition and finite convergence of the Douglas‐Rachford algorithm for solving convex feasibility problems in Euclidean spaces
On Slater’s condition and finite convergence of the Douglas‐Rachford algorithm for solving convex feasibility problems in Euclidean spaces
2016,
The Douglas–Rachford algorithm is a classical and very successful method for...
Cumulative weighting optimization
Cumulative weighting optimization
2016,
Global optimization problems with limited structure (e.g., convexity or...
A sharp Lagrange multiplier theorem for nonlinear programs
A sharp Lagrange multiplier theorem for nonlinear programs
2016,
For a nonlinear program with inequalities and under a Slater constraint qualification,...
Global behavior of the Douglas‐Rachford method for a nonconvex feasibility problem
Global behavior of the Douglas‐Rachford method for a nonconvex feasibility problem
2016,
In recent times the Douglas–Rachford algorithm has been observed empirically to...
Linear and parabolic relaxations for quadratic constraints
Linear and parabolic relaxations for quadratic constraints
2016,
This paper presents new techniques for filtering boxes in the presence of an...
Functional inequalities, regularity and computation of the deficit and surplus variables in the financial equilibrium problem
Functional inequalities, regularity and computation of the deficit and surplus variables in the financial equilibrium problem
2016,
This paper is concerned with a general model of financial flows and prices related to...
Coderivatives of implicit multifunctions and stability of variational systems
Coderivatives of implicit multifunctions and stability of variational systems
2016,
We establish formulas for computing/estimating the regular and Mordukhovich...
Stochastic filter methods for generally constrained global optimization
Stochastic filter methods for generally constrained global optimization
2016,
A filter based template for bound and otherwise constrained global optimization of...
Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games
Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games
2016,
In this paper, we first introduce the notion of cooperative equilibria in...
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
2016,
We introduce a relaxed‐projection splitting algorithm for solving variational...
Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
Finding sparse solutions of systems of polynomial equations via group-sparsity optimization
2015,
The paper deals with the problem of finding sparse solutions to systems of polynomial...
An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
2015,
A linear program with linear complementarity constraints (LPCC) is among the simplest...
Papers per page: