Pages that link to "Item:Q1922694"
From MaRDI portal
The following pages link to Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694):
Displaying 30 items.
- On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← 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)
- Long-step strategies in interior-point primal-dual methods (Q1361105) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts (Q1373727) (← links)
- An analytic center cutting plane method for pseudomonotone variational inequalities (Q1374377) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs (Q2442074) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- A conflict-directed approach to chance-constrained mixed logical linear programming (Q6080642) (← links)
- A \(J\)-symmetric quasi-Newton method for minimax problems (Q6120841) (← links)
- A simple method for convex optimization in the oracle model (Q6589751) (← links)
