Journal of Optimization Theory and Applications 2008

10 papers
In 2008, the Journal of Optimization Theory and Applications featured research centered on algorithmic refinements and the theoretical properties of solution sets. Key contributions included the development of hybrid conjugate gradient methods for convex optimization over fixed-point sets and modified proximal-point algorithms for maximal monotone operators in Banach spaces. These studies reflect a focus on iterative techniques and their convergence properties within specific mathematical frameworks. The year’s edition also explored practical applications and geometric analysis. Research addressed minimum-time travel for vehicles with acceleration limits through receding-horizon implementation, bridging optimization theory with control engineering. Theoretical investigations covered the connectedness of efficient solution sets in generalized systems and the application of homotopy methods to multiobjective programming. Additionally, work on polyhedral projection and parametric programming highlighted ongoing interest in the structural analysis of optimization problems. Prolific contributors during this period included authors such as Ji Sun, Qing-Shan Jia, and Hideaki Iiduka.

Top Authors

AuthorPapers
Colin Jones1
Hideaki Iiduka1
Qing-Shan Jia1

Papers

Title
Connectedness of the Set of Efficient Solutions for Generalized Systems
Connectedness of the Set of Efficient Solutions for Generalized Systems
Homotopy Method for a General Multiobjective Programming Problem
Homotopy Method for a General Multiobjective Programming Problem
Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of a Nonexpansive Mapping
Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of a Nonexpansive Mapping
Minimum-Time Travel for a Vehicle with Acceleration Limits: Theoretical Analysis and Receding-Horizon Implementation
Modified Proximal-Point Algorithm for Maximal Monotone Operators in Banach Spaces
On Polyhedral Projection and Parametric Programming
Universal Alignment Probability Revisited