Author Description

Optimality conditions for some nonconvex problems.- A general perturbation theory for optimization problems.- On the theoretical basis for methods for parametric optimization problems.- Basic solutions and a 'simplex' method for a class of continuous linear programs.- A probabilistic algorithm for global optimization problems with a dimensionality reduction technique.- The method of feasible directions for optimization problems with subdifferentiable objective function.- Factorized variable metric algorithms for unconstrained optimization.- A unified approach to nonlinear programming algorithms basing on sequential unconstrained minimizations.- Minimax optimization using quasi-newton methods.- Algorithms for the solution of a discrete minimax Subgradient methods and a new fast newton - Method.- Algorithm of search for global extremum of function from variables measured in different scales.- A method for solving equality constrained optimization problems by unconstrained minimization.- Randomly generated nonlinear programming test problems.- Method of regularized approximations and its application to convex programming.- Methods of hierarchical optimization for interconnected systems.- Structural analysis of large nonlinear programming problems.- On the use of statistical models of multimodal functions for the construction of the optimization algorithms.- Stability analysis in pure and mixed-integer linear programming.- Alternative group relaxation of integer programming problems.- Efficient method applying incomplete ordering for solving the binary knapsack problem.- Weighted satisfiability problems and some implications.- On two methods for solving the bottleneck matching problem.- Fast approximation algorithms for knapsack type problems.- Computational relations between various definitions of matroids and independence systems.- Relations among integer programs.- Linear optimization for linear and bottleneck objectives with one nonlinear parameter.- Selected aspect