Pages that link to "Item:Q174575"

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

Displaying 50 items.

• A smoothing SQP method for nonlinear programs with stability constraints arising from power systems (Q434161) (← links)
• A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints (Q434165) (← links)
• The impact of sampling methods on bias and variance in stochastic linear programs (Q434168) (← links)
• Machine learning for global optimization (Q434171) (← links)
• A primal-dual augmented Lagrangian (Q434173) (← links)
• TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities (Q434175) (← links)
• Implementing the Nelder-Mead simplex algorithm with adaptive parameters (Q434176) (← links)
• A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
• Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
• Kernel search: a new heuristic framework for portfolio selection (Q434181) (← links)
• Overlapping restricted additive Schwarz method applied to the linear complementarity problem with an \(H\)-matrix (Q434183) (← links)
• An efficient label setting/correcting shortest path algorithm (Q434184) (← links)
• Monte Carlo algorithm for trajectory optimization based on Markovian readings (Q434185) (← links)
• Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms (Q434187) (← links)
• A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei (Q453599) (← links)
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• Automated knowledge source selection and service composition (Q453606) (← links)
• Smoothing approach to Nash equilibrium formulations for a class of equilibrium problems with shared complementarity constraints (Q453608) (← links)
• Robust portfolio optimization: a conic programming approach (Q453610) (← links)
• An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
• Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
• A combined class of self-scaling and modified quasi-Newton methods (Q453615) (← links)
• Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
• Optimal control of Maxwell's equations with regularized state constraints (Q453618) (← links)
• Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
• A preconditioning technique for Schur complement systems arising in stochastic optimization (Q453622) (← links)
• The generalized trust region subproblem (Q457202) (← links)
• Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205) (← links)
• Robust least square semidefinite programming with applications (Q457207) (← links)
• Proximal methods for the latent group lasso penalty (Q457209) (← links)
• A unified algorithm for mixed \(l_{2,p}\)-minimizations and its application in feature selection (Q457211) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
• CVaR-constrained stochastic programming reformulation for stochastic nonlinear complementarity problems (Q457217) (← links)
• Determination of initial temperature in fast simulated annealing (Q457220) (← links)
• Adaptively refined dynamic program for linear spline regression (Q457223) (← links)
• Robust registration of point sets using iteratively reweighted least squares (Q457225) (← links)
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
• On the semilocal convergence behavior for Halley's method (Q457227) (← links)
• POD a-posteriori error analysis for optimal control problems with mixed control-state constraints (Q457230) (← links)
• Adaptive POD basis computation for parametrized nonlinear systems using optimal snapshot location (Q457232) (← links)
• Subgrid scale eddy viscosity finite element method on optimal control of system governed by unsteady Oseen equations (Q457234) (← links)
• A survey on multi-objective evolutionary algorithms for many-objective problems (Q457238) (← links)
• Implementation aspects of interactive multiobjective optimization for modeling environments: the case of GAMS-NIMBUS (Q457241) (← links)
• Advanced particle swarm assisted genetic algorithm for constrained optimization problems (Q457243) (← links)
• An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints (Q461437) (← links)
• On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators (Q461439) (← links)
• An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← links)