Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem
From MaRDI portal
Publication:5478873
DOI10.1080/10556780500079086zbMath1091.49030OpenAlexW1972092444MaRDI QIDQ5478873
T. Mouktonglang, Takashi Tsuchiya, Leonid Faybusovich
Publication date: 13 July 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500079086
Multi-objective and goal programming (90C29) Interior-point methods (90C51) Linear-quadratic optimal control problems (49N10)
Related Items
Deterministic Kalman filtering on semi-infinite interval, Numerical experiments with universal barrier functions for cones of Chebyshev systems, On Hazan's algorithm for symmetric programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex optimization problem: The infinite-horizon linear-quadratic control problem with quadratic constraints
- Infinite-dimensional quadratic optimization: Interior-point methods and control applications
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- On a commutative class of search directions for linear programming over symmetric cones
- Lectures on Modern Convex Optimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Matrices
- A long-step primal--dual algorithm for the symmetric programming problem
- A Jordan-algebraic approach to potential-reduction algorithms