In this paper, we propose a strongly sub-feasible direction method for the solution of inequality constrained optimization problems whose objective functions are not necessarily differentiable. The algorithm combines the subgradient aggregation technique with the ideas of generalized cutting...

The computational time required by interior-point methods is often dominated by the solution of linear systems of equations. An efficient specialized interior-point algorithm for primal block-angular problems has been used to solve these systems by combining Cholesky factorizations for the block...

One of the main services of National Statistical Agencies (NSAs) for the current Information Society is the dissemination of large amounts of tabular data, which is obtained from microdata by crossing one or more categorical variables. NSAs must guarantee that no confidential individual...

In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve...

Variational inequality theory facilitates the formulation of equilibrium problems in economic networks. Examples of successful applications include models of supply chains, financial networks, transportation networks, and electricity networks. Previous economic network equilibrium models that...

This paper considers line search optimization methods using a mathematical framework based on the simple concept of a v-pattern and its properties. This framework provides theoretical guarantees on preserving, in the localizing interval, a local optimum no worse than the starting point. Notably,...

An effective sourcing strategy leads to cost savings and value added collaborations. For radical innovative product sourcing (RIPS), the exact nature and demand of products are highly uncertain. As such, knowledge sharing competences and production capacities of potential suppliers are...

We consider the problem of minimizing a smooth function over a feasible set defined as the Cartesian product of convex compact sets. We assume that the dimension of each factor set is huge, so we are interested in studying inexact block coordinate descent methods (possibly combined with column...

Robust optimization problems, which have uncertain data, are considered. We prove surrogate duality theorems for robust quasiconvex optimization problems and surrogate min–max duality theorems for robust convex optimization problems. We give necessary and sufficient constraint qualifications...

In this study, the optimal burn time for low-thrust impulsive propulsion systems is investigated to raise the perigee altitude of a low-Earth orbit. The maneuver is done using spin-stabilized attitude control and impulsive thrusting system for a time interval centered about apogee point. On the...