A New Inexact Smoothing Method for SCLP

Xiao Ni Chi; Qing Zhang

doi:10.4028/www.scientific.net/AMM.421.534

Paper Titles

Firefly Algorithm for Optimization Problem
p.512

Research on the Indoor Location Algorithm Based on RFID
p.518

The Image Segmentation System Based on Gauss Process
p.523

Prediction of Resting-State EEG Using High-Dimensional Patterns
p.528

A New Inexact Smoothing Method for SCLP
p.534

The Research on Information Architecture and Security Protection of Smart Grid
p.541

Lean Information Management of Manual Assembly Processes: Creating IT-Based Information Systems for Assembly Staff Simultaneous to the Product Engineering Process
p.546

Influence Factors of Networked Control System Performance and Simulation
p.554

Research on the Intelligent Management of Access Control System for Laboratory Center
p.562

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 421A New Inexact Smoothing Method for SCLP

A New Inexact Smoothing Method for SCLP

Abstract:

In this paper, a new inexact smoothing method is presented for solving the symmetric conic linear programming (SCLP) in materials. Based on a regularized version of Chen-Harker-Kanzow-Smale smoothing function, our algorithm reformulates the SCLP as an equivalent nonlinear system of equations. At each iteration, Newtons method is adopted to solve the system approximately. Under suitable assumptions, the algorithm is proved to possess global convergence and local superlinear convergence.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 421)

Pages:

534-537

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.421.534

Citation:

Cite this paper

Online since:

September 2013

Authors:

Xiao Ni Chi, Qing Zhang

Keywords:

Global Convergence, Inexact Search Direction, Smoothing Newton Method, Symmetric Conic Linear Programming

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. H. Schmieta and F. Alizadeh: Associate and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 26 (2001), pp.543-564.

DOI: 10.1287/moor.26.3.543.10582

Google Scholar

[2] T. Nie and W. Z. Gu: Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions. J. Appl. Math. Comput. 35 (2011), pp.73-92.

DOI: 10.1007/s12190-009-0341-7

Google Scholar

[3] H. Che, Y. Wang and M. Li: A smoothing inexact Newton method for P0 nonlinear complementarity problem. Front. Math. China. 7 (2012), pp.1043-1058.

DOI: 10.1007/s11464-012-0245-y

Google Scholar

[4] Z. Huang and T. Nie: Smoothing algorithms for complementarity problems over symmetric cones. Comput. Optim. Appl. 45 (2010), pp.557-579.

DOI: 10.1007/s10589-008-9180-y

Google Scholar

[5] D. Sun and J. Sun: Strong semismoothness of Fischer-Burmeister SDC and SOC complementarity functions. Math. Program. 103 (2005), pp.575-581.

DOI: 10.1007/s10107-005-0577-4

Google Scholar

[6] F. Clarke: Optimization and Nonsmooth Analysis. John Wiley and Sons, New York (1983).

Google Scholar