TITLE

# Applications of Primal-dual Interior Methods in Structural Optimization

AUTHOR(S)
Hoppe, Ronald H. W.; Petrova, Svetozara I.
PUB. DATE
January 2003
SOURCE
Computational Methods in Applied Mathematics;2003, Vol. 3 Issue 1, p159
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
94563853

## Related Articles

• THE INTERIOR-POINT METHOD FOR LINEAR PROGRAMMING. Astfalk, Greg; Lustig, Irvin; Marsten, Roy; Shanno, David // IEEE Software;Jul92, Vol. 9 Issue 4, p61

Outlines the formulation of a primal-dual variant of the interior-point method for difficult problems in linear programming. Theoretical foundation for interior-point methods; How to transform a constrained optimization problem, with equality constraints, into an unconstrained problem;...

• Efficient robust optimization for robust control with constraints. Goulart, Paul J.; Kerrigan, Eric C.; Ralph, Daniel // Mathematical Programming;Aug2008, Vol. 114 Issue 1, p115

This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed linear constraints on the states and inputs. The problem of computing an optimal state feedback control policy, given the current state, is...

• AN OPTIMAL METHOD FOR ADJUSTING THE CENTERING PARAMETER IN THE WIDE-NEIGHBORHOOD PRIMAL-DUAL INTERIOR-POINT ALGORITHM FOR LINEAR PROGRAMMING. Wen-bao Ai // Journal of Computational Mathematics;May2004, Vol. 22 Issue 3, p437

In this paper we present a dynamic optimal method for adjusting the centering parameter in the wide-neighborhood primal-dual interior-point algorithms for linear programming, while the centering parameter is generally a constant in the classical wide-neighborhood primal-dual interior-point...

• OPTIMIZATION-BASED APPROACH TO PATH PLANNING FOR CLOSED CHAIN ROBOT SYSTEMS. Szynkiewicz, Wojciech; Błaszczyk, Jacek // International Journal of Applied Mathematics & Computer Science;Dec2011, Vol. 21 Issue 4, p659

An application of advanced optimization techniques to solve the path planning problem for closed chain robot systems is proposed. The approach to path planning is formulated as a "quasi-dynamic" NonLinear Programming (NLP) problem with equality and inequality constraints in terms of the joint...

• An Implementable First-Order Primal-Dual Algorithm for Structured Convex Optimization. Feng Ma; Mingfang Ni; Lei Zhu; Zhanke Yu // Abstract & Applied Analysis;2014, p1

Many application problems of practical interest can be posed as structured convex optimization models. In this paper, we study a new first-order primaldual algorithm. The method can be easily implementable, provided that the resolvent operators of the component objective functions are simple to...

• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method. Gondzio, Jacek // INFORMS Journal on Computing;Winter97, Vol. 9 Issue 1, p73

Addresses issues concerning an analysis of large and sparse linear programming problems prior to solving them with an interior point based optimizer. Types of presolve procedures; Discussion of the problem of identifying and aggregating linearly dependent columns; Description of the...

• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms. Yan Qin Bai; Jin Li Guo; Roos, Cornelis // Acta Mathematica Sinica;Dec2009, Vol. 25 Issue 12, p2169

Kernel functions play an important role in defining new search directions for primal-dual interior-point algorithm for solving linear optimization problems. In this paper we present a new kernel function which yields an algorithm with the best known complexity bound for both large- and...

• A path to the Arrow—Debreu competitive market equilibrium. Yinyu Ye // Mathematical Programming;Jan2008, Vol. 111 Issue 1/2, p315

We present polynomial-time interior-point algorithms for solving the Fisher and Arrowâ€“Debreu competitive market equilibrium problems with linear utilities and n players. Both of them have the arithmetic operation complexity bound of $${O(n^{4}log(1/\epsilon}$$ )) for computing an...

• A Full Nesterov-Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization. Zangiabadi, M.; Gu, G.; Roos, C. // Journal of Optimization Theory & Applications;Sep2013, Vol. 158 Issue 3, p816

After a brief introduction to Jordan algebras, we present a primal-dual interior-point algorithm for second-order conic optimization that uses full Nesterov-Todd steps; no line searches are required. The number of iterations of the algorithm coincides with the currently best iteration bound for...

• Modified Lagrangian Methods for Separable Optimization Problems. Hamdi, Abdelouahed; Mukheimer, Aiman A. // Abstract & Applied Analysis;2012, p1

We propose a convergence analysis of a new decomposition method to solve structured optimization problems. The proposed scheme is based on a class of modified Lagrangians combined with the allocation of resources decomposition algorithm. Under mild assumptions, we show that the method generates...

Share