A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones

A barrier-based smoothing proximal point algorithm for NCPs over closed convex cones

We present a new barrier-based method of constructing smoothing approximations for the Euclidean projector onto closed convex cones. These smoothing approximations are used in a smoothing proximal point algorithm to solve monotone nonlinear complementarity problems (NCPs) over a convex cone via the...

Saved in:

書目詳細資料
Main Authors:	Chua, Chek Beng., Li, Zhen.
其他作者:	School of Physical and Mathematical Sciences
格式:	Article
語言:	English
出版:	2013
在線閱讀:	https://hdl.handle.net/10356/97077 http://hdl.handle.net/10220/13174
標簽:	添加標簽沒有標簽, 成為第一個標記此記錄!

相似書籍

UNDERSTANDING THE JACOBIAN OF THE METRIC PROJECTOR OVER CLOSED CONVEX CONES
由: OUN YEJIU
出版: (2021)

The primal-dual second-order cone approximations algorithm for symmetric cone programming
由: Chua, Chek Beng.
出版: (2009)

Dykstra’s Splitting and an Approximate Proximal Point Algorithm for Minimizing the Sum of Convex Functions
由: PANG, CH JEFFREY
出版: (2019)

A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
由: Chua, Chek Beng, et al.
出版: (2015)

A superlinearly convergent smoothing newton continuation algorithm for variational inequalities over definable sets
由: Chua, Chek Beng, et al.
出版: (2015)

A continuation method for nonlinear complementarity problems over symmetric cones
由: Chua, Chek Beng., et al.
出版: (2011)

Relating homogeneous cones and positive definite cones via T-algebras
由: Chua, Chek Beng.
出版: (2009)

Global Minimization of Best Proximity Points for Some Nonlinear Mappings and Some Algorithms for Solving Unconstrained Convex Optimization Problems
由: Panitarn Sarnmeta
出版: (2020)

Distance between a point and a convex cone in n-dimensional space: Computation and applications
由: Zheng, Y., et al.
出版: (2014)

Invariance and efficiency of convex representations
由: Chua, Chek Beng., et al.
出版: (2009)

A T-algebraic approach to primal-dual interior-point algorithms
由: Chua, Chek Beng.
出版: (2009)

Smooth convex approximation and its applications
由: SHI SHENGYUAN
出版: (2010)

On strongly convergent parallel proximal point algorithms
由: Pham, Ky Anh, et al.
出版: (2017)

Interior proximal point algorithm for linear programs
由: Setiono, R.
出版: (2014)

Distance computation between smooth convex objects
由: Ong, Chong Jin
出版: (2014)

A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
由: Huang, Z.-H., et al.
出版: (2014)

Interior dual proximal point algorithm for linear programs
由: Setiono, R.
出版: (2014)

An implementable proximal point algorithmic framework for nuclear norm minimization
由: Liu, Y.-J., et al.
出版: (2014)

A proximal point algorithm for sequential feature extraction applications
由: Doan, X.V., et al.
出版: (2014)

Smoothing approximations for two classes of convex eigenvalue optimization problems
由: YU QI
出版: (2010)

ALGORITHMS FOR CONVEX SWITCHING SYSTEMS
由: LI SHANGRU
出版: (2017)

Minimum recession-compatible subsets of closed convex sets
由: He, Y., et al.
出版: (2013)

An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming
由: Lin, Hui Ling
出版: (2012)

Proximal point algorithms involving fixed point iteration for nonexpansive mappings in cat(κ) spaces
由: Nuttapol Pakkaranang, et al.
出版: (2018)

Closed smooth piecewise bicubic surfaces
由: Lee, S.L., et al.
出版: (2014)

Computation of penetration between smooth convex objects in three-dimensional space
由: Ong, C.J.
出版: (2014)

A proximal point algorithm for log-determinant optimization with group Lasso regularization
由: Yang, J., et al.
出版: (2014)

STOCHASTIC BREGMAN GRADIENT-TYPE ALGORITHMS FOR NONCONVEX OPTIMIZATION AND CONVEX-CONCAVE SADDLE POINT PROBLEMS
由: DING KUANGYU
出版: (2023)

Numerical experiments with universal barrier functions for cones of Chebyshev systems
由: Faybusovich L., et al.
出版: (2014)

Numerical experiments with universal barrier functions for cones of Chebyshev systems
由: L. Faybusovich, et al.
出版: (2018)

On controlling the parameter in the logarithmic barrier term for convex programming problems
由: Kortanek, K.O., et al.
出版: (2014)

Best proximity point results for g-proximal geraghty mappings
由: Phakdi Charoensawan, et al.
出版: (2020)

IMPROVING ALGORITHMS FOR CONVEX SET INTERSECTION PROBLEMS
由: LIM CHUAN LI
出版: (2021)

Hybrid algorithm for common best proximity points of some generalized nonself nonexpansive mappings
由: Nuttawut Bunlue, et al.
出版: (2018)

A new hybrid algorithm for global minimization of best proximity points in hilbert spaces
由: Raweerote Suparatulatorn, et al.
出版: (2019)

An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
由: Jiang, K., et al.
出版: (2014)

Isolation between electric and magnetic antennas in close proximity
由: Zhuang, Jingxin.
出版: (2009)

Best proximity point for proximal berinde nonexpansive mappings on starshaped sets
由: Nuttawut Bunlue, et al.
出版: (2018)

Solving log-determinant optimization problems by a Newton-CG primal proximal point algorithm
由: Wang, C., et al.
出版: (2014)

SOLVING LOG-DETERMINANT OPTIMISATION PROBLEMS BY A NEWTON-CG PRIMAL PROXIMAL POINT ALGORITHM
由: WANG XINGYIN
出版: (2021)