Pages that link to "Item:Q163006"

The following pages link to Mathematical Programming. Series A. Series B (Q163006):

Displaying 50 items.

• A feasible method for optimization with orthogonality constraints (Q101635) (← links)
• Primal-dual subgradient methods for convex problems (Q116219) (← links)
• Smooth minimization of non-smooth functions (Q128676) (← links)
• Solving semidefinite-quadratic-linear programs using SDPT3 (Q146795) (← links)
• Continuous knapsack sets with divisible capacities (Q263180) (← links)
• A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
• Error bounds for mixed integer linear optimization problems (Q263186) (← links)
• A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
• A second-order method for strongly convex \(\ell _1\)-regularization problems (Q263191) (← links)
• Solving variational inequalities with monotone operators on domains given by linear minimization oracles (Q263192) (← links)
• A nonsmooth Robinson's inverse function theorem in Banach spaces (Q263194) (← links)
• Generalized Gauss inequalities via semidefinite programming (Q263197) (← links)
• The convex recoloring problem: polyhedra, facets and computational experiments (Q263202) (← links)
• The projected faces property and polyhedral relations (Q263204) (← links)
• Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming (Q263206) (← links)
• Two pairs of families of polyhedral norms versus \(\ell _p\)-norms: proximity and applications in optimization (Q263209) (← links)
• Parallel coordinate descent methods for big data optimization (Q263212) (← links)
• Spectral simplex method (Q263213) (← links)
• S-lemma with equality and its applications (Q263215) (← links)
• Variable metric random pursuit (Q263217) (← links)
• A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
• A semi-definite programming approach for robust tracking (Q263222) (← links)
• Special issue on ``Integer programming under uncertainty'' (Q291030) (← links)
• Total variation bounds on the expectation of periodic functions with applications to recourse approximations (Q291034) (← links)
• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
• Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming (Q291043) (← links)
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Chance-constrained problems and rare events: an importance sampling approach (Q291054) (← links)
• On the mixing set with a knapsack constraint (Q291057) (← links)
• Decomposition algorithms for two-stage chance-constrained programs (Q291060) (← links)
• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
• Robust optimization approach for a chance-constrained binary knapsack problem (Q291067) (← links)
• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• Nonsmooth Lyapunov pairs for differential inclusions governed by operators with nonempty interior domain (Q301649) (← links)
• An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
• Linear passive systems and maximal monotone mappings (Q301654) (← links)
• A game-theoretic approach to computation offloading in mobile cloud computing (Q301661) (← links)
• An approximation scheme for a class of risk-averse stochastic equilibrium problems (Q301663) (← links)
• Equilibrium, uncertainty and risk in hydro-thermal electricity systems (Q301665) (← links)
• A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
• OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
• Simple examples for the failure of Newton's method with line search for strictly convex minimization (Q304219) (← links)
• Lipschitz and Hölder stability of optimization problems and generalized equations (Q304221) (← links)
• Sufficient optimality conditions hold for almost all nonlinear semidefinite programs (Q304224) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
• A polyhedral study of production ramping (Q304233) (← links)