Pages that link to "Item:Q174575"

The following pages link to Computational Optimization and Applications (Q174575):

Displaying 50 items.

• A linearly convergent derivative-free descent method for strongly monotone complementarity problems (Q1303775) (← links)
• Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs (Q1303776) (← links)
• Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints (Q1303778) (← links)
• A modified barrier-augmented Lagrangian method for constrained minimization (Q1303780) (← links)
• Finite sample behaviour of an ergodically fast line-search algorithm (Q1303781) (← links)
• Learning equilibrium play: A myopic approach (Q1303782) (← links)
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems (Q1303783) (← links)
• An arbitrary starting variable dimension algorithm for computing an integer point of a simplex (Q1303784) (← links)
• A note on the approximation of a minimum-weight maximal independent set (Q1303785) (← links)
• A quadratically convergent local algorithm on minimizing sums of the largest eigenvalues of a symmetric matrix (Q1312086) (← links)
• A reduced Hessian method for constrained optimization (Q1312087) (← links)
• Isotropic effective energy simulated annealing searches for low energy molecular cluster states (Q1312089) (← links)
• Orthogonal and conjugate basis methods for solving equality constrained minimization problems (Q1312090) (← links)
• Bilinear separation of two sets in \(n\)-space (Q1315445) (← links)
• A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
• On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
• Computational study of the nonhierarchical decomposition algorithm (Q1315449) (← links)
• The ellipsoid algorithm using parallel cuts (Q1315450) (← links)
• Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
• On the calculation of minimum variance estimators for unobservable dependent variables (Q1315452) (← links)
• Numerical approximations and regularizations of Riccati equations arising in hyperbolic dynamics with unbounded control operators (Q1315453) (← links)
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking (Q1318276) (← links)
• A regularized stochastic decomposition algorithm for two-stage stochastic linear programs (Q1318278) (← links)
• A modified predictor-corrector method for linear programming (Q1318279) (← links)
• Reducing the number of variables in integer and linear programming problems (Q1326508) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• Local convergence of interior-point algorithms for degenerate monotone LCP (Q1326510) (← links)
• A parameterized Newton method and a quasi-Newton method for nonsmooth equations (Q1326511) (← links)
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
• Data parallel computing for network-structured optimization problems (Q1328430) (← links)
• An exact algorithm for the maximum stable set problem (Q1328431) (← links)
• Global convergence and rate of convergence of a method of centers (Q1328432) (← links)
• Stable barrier-projection and barrier-Newton methods in linear programming (Q1342880) (← links)
• Scaling, shifting and weighting in interior-point methods (Q1342881) (← links)
• Supernode processing of mixed-integer models (Q1342883) (← links)
• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming (Q1342884) (← links)
• On the efficacy of distributed simplex algorithms for linear programming (Q1342885) (← links)
• A bicriterial optimization problem of antenna design (Q1356065) (← links)
• Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions (Q1356066) (← links)
• The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems (Q1356067) (← links)
• Annealing algorithms for multisource absolute location problems on graph (Q1356068) (← links)
• The two-period travelling salesman problem applied to milk collection in Ireland (Q1356071) (← links)
• On the interplay among entropy, variable metrics and potential functions in interior-point algorithms (Q1360218) (← links)
• Iterative averaging of entropic projections for solving stochastic convex feasibility problems (Q1360219) (← links)
• A parallel algorithm for multiple objective linear programs (Q1360220) (← links)
• Recovery from numerical instability during basis reinversion (Q1360222) (← links)
• Convergence of numerical algorithms for the approximations to Riccati equations arising in smart material acoustic structure interactions (Q1360223) (← links)
• New inexact parallel variable distribution algorithms (Q1360242) (← links)
• A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates (Q1360244) (← links)