Pages that link to "Item:Q4895614"
From MaRDI portal
The following pages link to Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems (Q4895614):
Displaying 35 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- A cone constrained convex program: structure and algorithms (Q384210) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Analytic center cutting plane methods for variational inequalities over convex bodies (Q824529) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← 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)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← 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)
- An analytic center cutting plane method for pseudomonotone variational inequalities (Q1374377) (← links)
- Large-scale convex optimization methods for air quality policy assessment. (Q1428124) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach (Q1433167) (← links)
- Entropic perturbation method for solving a system of linear inequalities (Q1612393) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
- A proximal analytic center cutting plane algorithm for solving variational inequality problems (Q1952872) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- An oracle for the discrete-time integral quadratic constraint problem (Q2280816) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Solving variational inequalities defined on a domain with infinitely many linear constraints (Q2642631) (← links)
- A path-following cutting plane method for some monotone variational inequalities<sup>∗</sup> (Q2709450) (← links)
- Rate of convergence of a class of numerical methods solving linear inequality systems (Q3112495) (← links)
- An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)
- Homogeneous analytic center cutting plane methods with approximate centers (Q4504783) (← links)
- Polynomial Interior Point Cutting Plane Methods (Q4653547) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Distributionally robust portfolio optimization with second-order stochastic dominance based on Wasserstein metric (Q6125219) (← links)
