Pages that link to "Item:Q174575"

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

Displaying 50 items.

• Topology optimization of trusses -- random cost method versus evolutionary algorithms (Q1819162) (← links)
• Optimization based algorithms for finding minimal cost ring covers in survivable networks (Q1819163) (← links)
• A performance analysis of Appel's algorithm for performing pairwise calculations in a many particle system (Q1819165) (← links)
• Computational study of the relationships between feasible and efficient sets and an approximation (Q1819169) (← links)
• A complete efficiency ranking of decision making units in data envelopment analysis (Q1819171) (← links)
• Primal and dual stability results for variational inequalities (Q1841552) (← links)
• A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints (Q1841553) (← links)
• Merit functions for complementarity and related problems: a survey (Q1841554) (← links)
• A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems (Q1841556) (← links)
• Smoothing Newton and quasi-Newton methods for mixed complementarity problems (Q1841557) (← links)
• A smoothing Newton method for general nonlinear complementarity problems (Q1841558) (← links)
• Some methods based on the D-gap function for solving monotone variational inequalities (Q1841559) (← links)
• On two applications of \(H\)-differentiability to optimization and complementarity problems (Q1841560) (← links)
• Minimizing the mean damage for parallel-series systems with two failure modes (Q1841562) (← links)
• Accurate solution to overdetermined linear equations with errors using \(L_1\) norm minimization (Q1841564) (← links)
• On the convergence of descent algorithms (Q1856361) (← links)
• The maximum box problem and its application to data analysis (Q1856362) (← links)
• Predictor-corrector smoothing methods for linear programs with a more flexible update of the smoothing parameter (Q1856363) (← links)
• A mixed heuristic for circuit partitioning (Q1856364) (← links)
• Nonmonotone globalization techniques for the Barzilai-Borwein gradient method (Q1856365) (← links)
• Resource allocation with wobbly functions (Q1856366) (← links)
• Error estimates for the numerical approximation of a semilinear elliptic control problem (Q1856367) (← links)
• On numerical solution of shape inverse problems (Q1856369) (← links)
• Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions (Q1856370) (← links)
• A heuristic for moment-matching scenario generation (Q1866129) (← links)
• Scenario reduction algorithms in stochastic programming (Q1866130) (← links)
• Decomposition algorithms for stochastic programming on a computational grid (Q1866131) (← links)
• A note on the recursive and parallel structure of the Birge and Qi factorization for tree structured linear programs (Q1866132) (← links)
• Applying the minimum risk criterion in stochastic recourse programs (Q1866133) (← links)
• The sample average approximation method applied to stochastic routing problems: a computational study (Q1866135) (← links)
• A novel sampling approach to combinatorial optimization under uncertainty (Q1866137) (← links)
• A study of preconditioners for network interior point methods (Q1868386) (← links)
• Multiple cuts with a homogeneous analytic center cutting plane method (Q1868387) (← links)
• Postponing the choice of penalty parameter and step length (Q1868389) (← links)
• A solution method for a special class of nondifferentiable unconstrained optimization problems (Q1868391) (← links)
• Portfolio selection and transactions costs (Q1868392) (← links)
• Exploiting intermediate sparsity in computing derivatives for a Leapfrog scheme (Q1868394) (← links)
• A comparison of evolution strategies with other direct search methods in the presence of noise (Q1868395) (← links)
• A projected gradient method for vector optimization problems (Q1876582) (← links)
• STRSCNE: a scaled trust-region solver for constrained nonlinear equations (Q1876583) (← links)
• A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds (Q1876585) (← links)
• Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming (Q1876587) (← links)
• Regularized Newton methods for convex minimization problems with singular solutions (Q1876588) (← links)
• Preconditioning indefinite systems in interior point methods for optimization (Q1876589) (← links)
• Convex quadratic approximation (Q1876590) (← links)
• A feature selection Newton method for support vector machine classification (Q1876591) (← links)
• Global convergence properties of nonlinear conjugate gradient methods with modified secant condition (Q1876593) (← links)
• Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches (Q1876594) (← links)
• Interior point methods for second-order cone programming and OR applications (Q1888149) (← links)
• Ant colony optimisation for machine layout problems (Q1888150) (← links)