Pages that link to "Item:Q174575"

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

Displaying 50 items.

• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs (Q1888151) (← links)
• Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms (Q1888153) (← links)
• A post-optimality analysis algorithm for multi-objective optimization (Q1888156) (← links)
• Inexact primal-dual interior point iteration for linear programs in function spaces (Q1892594) (← links)
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
• The Lagrange-Newton method for state constrained optimal control problems (Q1892596) (← links)
• A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products (Q1892597) (← links)
• Sets and indices in linear programming modelling and their integration with relational data models (Q1892601) (← links)
• Efficient decomposition and linearization methods for the stochastic transportation problem (Q1908529) (← links)
• Algorithms for the solution of stochastic dynamic minimax problems (Q1908531) (← links)
• The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
• Parallel structural optimization applied to bone remodeling on distributed memory machines (Q1908534) (← links)
• A parallel descent algorithm for convex programming (Q1908925) (← links)
• A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
• A special case of set covering problems (Q1908929) (← links)
• Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768) (← links)
• Tensor-Krylov methods for large nonlinear equations (Q1915769) (← links)
• Best interpolation in a strip. II: Reduction to unconstrained convex optimization (Q1915770) (← links)
• Sensitivity analysis for parametric control problems with control-state constraints (Q1915771) (← links)
• A heuristic for the Steiner problem in graphs (Q1918915) (← links)
• Constructing the value function for an integer linear programme over a cone (Q1918916) (← links)
• A fast computational algorithm for the Legendre-Fenchel transform (Q1918918) (← links)
• Continuous optimization by a variant of simulated annealing (Q1918920) (← links)
• Solution of an equiweighted minimax location problem on a hemisphere (Q1918921) (← links)
• New constructs for the description of combinatorial optimization problems in algebraic modeling languages (Q1918922) (← links)
• Interior point methods for equilibrium problems (Q1928742) (← links)
• Approximate values for mathematical programs with variational inequality constraints (Q1928743) (← links)
• Reduced order solution of structured linear systems arising in certain PDE-constrained optimization problems (Q1928744) (← links)
• Convergence analysis of a proximal Gauss-Newton method (Q1928745) (← links)
• Evaluating bound-constrained minimization software (Q1928747) (← links)
• Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
• An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
• On the convergence of trust region algorithms for unconstrained minimization without derivatives (Q1928750) (← links)
• Convergence of distributed optimal control problems governed by elliptic variational inequalities (Q1928751) (← links)
• Active-set Newton methods for mathematical programs with vanishing constraints (Q1928752) (← links)
• Gap functions and penalization for solving equilibrium problems with nonlinear constraints (Q1928753) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• Margin maximization in spherical separation (Q1928756) (← links)
• Computational optimization strategies for the simulation of random media and components (Q1935568) (← links)
• Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
• A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
• Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization (Q1935573) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
• On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
• Constrained dogleg methods for nonlinear systems with simple bounds (Q1935576) (← links)
• A new modified nonmonotone adaptive trust region method for unconstrained optimization (Q1935577) (← links)
• A genetic algorithm based augmented Lagrangian method for constrained optimization (Q1935579) (← links)
• A local relaxation method for the cardinality constrained portfolio optimization problem (Q1935581) (← links)