Výsledky vyhľadávania - (abstrakty OR abstracts) computational complexity for mathematical programming problems

The Traveling Salesman Problem: A Computational Study Autor Applegate, David L, Bixby, Robert E, Chvátal, Vašek, Cook, William J

“…This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem…”
Získať plný text

A comment on “computational complexity of stochastic programming problems” Autor Hanasusanto, Grani A., Kuhn, Daniel, Wiesemann, Wolfram

“…Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical…”
Získať plný text

NP-hardness of deciding convexity of quartic polynomials and related problems Autor Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials…”
Získať plný text

Computational complexity of stochastic programming problems Autor Dyer, Martin, Stougie, Leen

“… the theoretical complexity of a variety of stochastic programming problems studied in this literature…”
Získať plný text

Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems Autor Ouyang, Yuyuan, Xu, Yangyang

“…On solving a convex-concave bilinear saddle-point problem (SPP), there have been many works studying the complexity results of first-order methods…”
Získať plný text

Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming Autor Xu, Yangyang

“… For these problems, we establish the global convergence rate of the inexact ALM and estimate its iteration complexity in terms of the number of gradient evaluations to produce a primal and/or primal…”
Získať plný text

On the computational complexity of membership problems for the completely positive cone and its dual Autor Dickinson, Peter J. C., Gijben, Luuk

“…Copositive programming has become a useful tool in dealing with all sorts of optimisation problems…”
Získať plný text

An abstract model for branching and its application to mixed integer programming Autor Le Bodic, Pierre, Nemhauser, George

“…The selection of branching variables is a key component of branch-and-bound algorithms for solving mixed-integer programming (MIP…”
Získať plný text

Two Projection Neural Networks With Reduced Model Complexity for Nonlinear Programming Autor Xia, Youshen, Wang, Jun, Guo, Wenzhong

“…) for solving nonlinear programming (NP) problems. Compared with existing projection neural networks for solving NP, the proposed two RDPNNs have a low-dimensional state space and low model complexity…”
Získať plný text

A Study on the Computational Complexity of the Bilevel Knapsack Problem Autor Caprara, Alberto, Carvalho, Margarida, Lodi, Andrea, Woeginger, Gerhard J.

“…We analyze the computational complexity of three fundamental variants of the bilevel knapsack problem…”
Získať plný text

Fault-Tolerant Families of Production Plans: Mathematical Model, Computational Complexity, and Branch-and-Bound Algorithms Autor Ogorodnikov, Yu. Yu, Rudakov, R. A., Khachai, D. M., Khachai, M. Yu

“… The traditional approach to modeling such systems is based on the use of stochastic models that describe the choice of a possible scenario of actions in the event of problems in a production or transportation network…”
Získať plný text

Complexity of stochastic dual dynamic programming Autor Lan, Guanghui

“… In this paper, we first establish the number of iterations, i.e., iteration complexity, required by a basic dual dynamic programming method for solving single-scenario multi…”
Získať plný text

Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function Autor Richtarik, Peter, Takac, Martin

“…), which cover the smooth case, to composite minimization, while at the same time improving the complexity by the factor of 4 and removing from the logarithmic term…”
Získať plný text

Universal gradient methods for convex optimization problems Autor Nesterov, Yu

“… Their only essential input parameter is the required accuracy of the solution. At the same time, for each particular problem class they automatically ensure the best possible rate of convergence…”
Získať plný text

Accelerated gradient methods for nonconvex nonlinear and stochastic programming Autor Ghadimi, Saeed, Lan, Guanghui

“…In this paper, we generalize the well-known Nesterov’s accelerated gradient (AG) method, originally designed for convex smooth optimization, to solve nonconvex and possibly stochastic optimization problems…”
Získať plný text

Iteration-complexity of first-order augmented Lagrangian methods for convex programming Autor Lan, Guanghui, Monteiro, Renato D. C.

“…This paper considers a special class of convex programming (CP) problems whose feasible regions consist of a simple compact convex set intersected with an affine manifold…”
Získať plný text

An Incremental Gradient Method for Optimization Problems with Variational Inequality Constraints Autor Kaushik, Harshal D., Samadi, Sepideh, Yousefian, Farzad

“…) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks…”
Získať plný text

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models Autor Birgin, E. G., Gardenghi, J. L., Martínez, J. M., Santos, S. A., Toint, Ph. L.

“…The worst-case evaluation complexity for smooth (possibly nonconvex) unconstrained optimization is considered…”
Získať plný text

Bilevel programming and the separation problem Autor Lodi, Andrea, Ralphs, Ted K., Woeginger, Gerhard J.

“… This paper examines the nature of the so-called separation problem, which is that of generating a valid inequality violated by a given real vector, usually arising as the solution to a relaxation…”
Získať plný text

An effective computational attempt for solving fully fuzzy linear programming using MOLP problem Autor Ebrahimnejad, Ali

“…) problem with three-objective functions. This paper provides a new technique for reducing the computational complexity of some current FFLP problems for situations that all imprecise data are represented as nonnegative triangular fuzzy numbers…”
Získať plný text