Pages that link to "Item:Q1273428"

The following pages link to A computational study of the homogeneous algorithm for large-scale convex optimization (Q1273428):

Displaying 23 items.

• Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
• The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
• A predictor-corrector algorithm with multiple corrections for convex quadratic programming (Q453603) (← links)
• Integrating design and production planning considerations in multi-bay manufacturing facility layout (Q703925) (← links)
• A tutorial on geometric programming (Q1027158) (← links)
• On homogeneous and self-dual algorithms for LCP (Q1361111) (← links)
• Interactions between nonlinear programming and modeling systems (Q1365050) (← links)
• On a homogeneous algorithm for the monotone complementarity problem (Q1572684) (← links)
• A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
• Compressed sensing in the spherical near-field to far-field transformation (Q2106500) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks (Q2263480) (← links)
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
• On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
• A primal-dual decomposition algorithm for multistage stochastic convex programming (Q2571003) (← links)
• Large-scale convex optimization via saddle point computation (Q2770079) (← links)
• On implementation of a self-dual embedding method for convex programming (Q3377974) (← links)
• Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
• On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization (Q4210326) (← links)
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization (Q4916322) (← links)
• Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem (Q5010047) (← links)
• Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method (Q5739130) (← links)