Pages that link to "Item:Q1922689"

The following pages link to A cutting plane algorithm for convex programming that uses analytic centers (Q1922689):

Displayed 31 items.

• Optimization under uncertainty with applications to design of truss structures (Q373938) ‎ (← links)
• On the volumetric path (Q691484) ‎ (← links)
• Self-concordant barriers for convex approximations of structured convex sets (Q707744) ‎ (← links)
• A second-order cone cutting surface method: Complexity and application (Q839677) ‎ (← links)
• A variable metric method for nonsmooth convex constrained optimization (Q865537) ‎ (← links)
• A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) ‎ (← links)
• Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) ‎ (← links)
• Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) ‎ (← links)
• Complexity of some cutting plane methods that use analytic centers (Q1352301) ‎ (← links)
• Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) ‎ (← links)
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) ‎ (← links)
• Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) ‎ (← links)
• A cutting-plane method to nonsmooth multiobjective optimization problems (Q1719612) ‎ (← links)
• A utility theory based interactive approach to robustness in linear optimization (Q1753136) ‎ (← links)
• A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) ‎ (← links)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) ‎ (← links)
• A cutting plane method from analytic centers for stochastic programming (Q1922690) ‎ (← links)
• Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) ‎ (← links)
• A simple method for convex optimization in the oracle model (Q2164690) ‎ (← links)
• Research on probabilistic methods for control system design (Q2276096) ‎ (← links)
• An oracle for the discrete-time integral quadratic constraint problem (Q2280816) ‎ (← links)
• Convex analysis in groups and semigroups: a sampler (Q2413078) ‎ (← links)
• A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) ‎ (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) ‎ (← links)
• Predicting abnormal returns from news using text classification (Q4683037) ‎ (← links)
• (Q5020878) ‎ (← links)
• An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) ‎ (← links)
• On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) ‎ (← links)
• Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) ‎ (← links)
• A \(J\)-symmetric quasi-Newton method for minimax problems (Q6120841) ‎ (← links)
• Learning lyapunov functions for hybrid systems (Q6201594) ‎ (← links)