Numerical experiments with universal barrier functions for cones of Chebyshev systems
From MaRDI portal
Publication:1029624
DOI10.1007/s10589-007-9101-5zbMath1169.90424OpenAlexW2003570633MaRDI QIDQ1029624
T. Mouktonglang, Leonid Faybusovich, Takashi Tsuchiya
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9101-5
Related Items
Recent contributions to linear semi-infinite optimization, Recent contributions to linear semi-infinite optimization: an update, Comparative study of RPSALG algorithm for convex semi-infinite programming, An exchange method with refined subproblems for convex semi-infinite programming problems, γ-Active Constraints in Convex Semi-Infinite Programming
Cites Work
- Unnamed Item
- Double exponential formulas for numerical integration
- Affine scaling algorithm fails for semidefinite programming
- Euclidean Jordan algebras and interior-point algorithms
- Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
- On Nesterov's approach to semi-infinite programming
- Self-Concordant Barriers for Cones Generated by Chebyshev Systems
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- Optimization Problems over Positive Pseudopolynomial Matrices
- Calculation of Universal Barrier Functions for Cones Generated by Chebyshev Systems Over Finite Sets
- Optimization Problems over Non-negative Polynomials with Interpolation Constraints
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem
- A long-step primal--dual algorithm for the symmetric programming problem
