Self-concordant barriers for convex approximations of structured convex sets

DOI10.1007/S10208-010-9069-XzbMATH Open1225.90100OpenAlexW2167124007WikidataQ57392903 ScholiaQ57392903MaRDI QIDQ707744FDOQ707744

Authors: Arkadi Nemirovski, Levent Tunçel 

Publication date: 8 October 2010

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10208-010-9069-x

Recommendations

• Improving complexity of structured convex optimization problems using self-concordant barriers
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
• Projectively Self-Concordant Barriers
• Interior-point methods for optimization

zbMATH Keywords

convex optimizationsemidefinite programminginterior-point methodspacking-covering problemsself-concordant barriers

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) Numerical methods based on nonlinear programming (49M37) Semidefinite programming (90C22) Convex functions and convex programs in convex geometry (52A41)

Cites Work

• Title not available (Why is that?)
• Smooth minimization of non-smooth functions
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Dual extrapolation and its applications to solving variational inequalities and related problems
• The maximum concurrent flow problem
• Hyperbolic programs, and their derivative relaxations
• Unconstrained convex minimization in relative scale
• Rounding of convex sets and efficient gradient methods for linear programming problems
• Solving combinatorial optimization problems using Karmarkar's algorithm
• A cutting plane algorithm for convex programming that uses analytic centers
• Fast Approximation Algorithms for Fractional Packing and Covering Problems
• Potential function methods for approximately solving linear programming problems: theory and practice.
• Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
• Towards a Practical Volumetric Cutting Plane Method for Convex Programming
• Coordination Complexity of Parallel Price-Directive Decomposition
• ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods
• Fast approximation algorithms for multicommodity flow problems
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

Cited In (7)

• A self-concordant interior point approach for optimal control with state constraints
• On self-concordant barriers for generalized power cones
• Projectively Self-Concordant Barriers
• On max-\(k\)-sums
• Improving complexity of structured convex optimization problems using self-concordant barriers
• Generalized self-concordant analysis of Frank-Wolfe algorithms
• On the optimal parameter of a self-concordant barrier over a symmetric cone

This page was built for publication: Self-concordant barriers for convex approximations of structured convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707744)