Pages that link to "Item:Q174575"

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

Displaying 50 items.

• Efficient algorithms for large scale global optimization: Lennard-Jones clusters (Q1415484) (← links)
• Shortest path auction algorithm without contractions using virtual source concept (Q1415485) (← links)
• An efficient Monte Carlo method for optimal control problems with uncertainty (Q1421741) (← links)
• Shape optimization and fictitious domain approach for solving free boundary problems of Bernoulli type (Q1421742) (← links)
• Lagrange-SQP techniques for the control constrained optimal boundary control for the Burgers equation (Q1421743) (← links)
• Analysis of properties of the solutions to parametric time-optimal problems (Q1421744) (← links)
• Two-connected networks with rings of bounded cardinality (Q1424779) (← links)
• A branch and bound algorithm for primary routes assignment in survivable connection oriented networks (Q1424781) (← links)
• Finding all maximal cliques in dynamic graphs (Q1424782) (← links)
• An augmented Lagrangian algorithm for large scale multicommodity routing (Q1424783) (← links)
• On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals (Q1424784) (← links)
• Updating the self-scaling symmetric rank one algorithm with limited memory for large-scale unconstrained optimization (Q1424786) (← links)
• Disaggregation of Diophantine equation with Boolean variables (Q1424788) (← links)
• On the minimizing trajectory of convex functions with unbounded level sets (Q1424789) (← links)
• Approximation of Boolean functions by local search (Q1424790) (← links)
• A general alternative procedure for solving negative degree of difficulty problems in geometric programming (Q1424794) (← links)
• Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs (Q1424795) (← links)
• A smoothing method for a mathematical program with P-matrix linear complementarity constraints (Q1430271) (← links)
• Comparison of two kinds of prediction-correction methods for monotone variational inequalities (Q1430272) (← links)
• Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems (Q1430273) (← links)
• A non-interior path following method for convex quadratic programming problems with bound constraints (Q1430274) (← links)
• A network improvement problem under different norms (Q1430275) (← links)
• A quasi-Newton quadratic penalty method for minimization equality constraints (Q1567477) (← links)
• A primal-dual algorithm for monotropic programming and its application to network optimization (Q1567479) (← links)
• A bundle algorithm applied to bilevel programming problems with non-unique lower level solutions (Q1567480) (← links)
• A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481) (← links)
• An implementation of Shor's \(r\)-algorithm (Q1567482) (← links)
• Solving stochastic linear programs with restricted recourse using interior point methods (Q1567483) (← links)
• Detecting embedded networks in LP using GUB structures and independent set algorithms (Q1567484) (← links)
• Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem (Q1567487) (← links)
• Iterative methods of solving stochastic convex feasibility problems and applications (Q1567488) (← links)
• Domain decomposition of optimal control problems for dynamic networks of elastic strings (Q1578499) (← links)
• Optimization techniques for solving elliptic control problems with control and state constraints. I: Boundary control (Q1578500) (← links)
• Application of the augmented Lagrangian-SQP method to optimal control problems for the stationary Burgers equation (Q1578502) (← links)
• Mathematical study of very high voltage power networks. III: The optimal AC power flow problem (Q1578503) (← links)
• Convergence of the gradient projection method for generalized convex minimization (Q1583582) (← links)
• A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method (Q1583583) (← links)
• Convergence of the nonmonotone Perry and Shanno method for optimization (Q1583585) (← links)
• A theoretical and numerical comparison of some semismooth algorithms for complementarity problems (Q1583587) (← links)
• Evaluating Lipschitz constants for functions given by algorithms (Q1588827) (← links)
• Master-slave strategy and polynomial approximation (Q1588828) (← links)
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems (Q1588830) (← links)
• Heuristic procedures for the capacitated vehicle routing problem (Q1588831) (← links)
• Scheduling classes on a college campus (Q1588834) (← links)
• Globally convergent algorithms for unconstrained optimization (Q1588835) (← links)
• Line-sum symmetry via the DomEig algorithm (Q1588837) (← links)
• Distance matrix completion by numerical optimization (Q1588838) (← links)
• Local convergence of the affine-scaling interior-point algorithm for nonlinear programming (Q1588839) (← links)
• Semidefinite programming techniques for reduced order systems with guaranteed stability margins (Q1588840) (← links)
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints (Q1588841) (← links)