Smoothing Partially Exact Penalty Function of Biconvex Programming
From MaRDI portal
Publication:5149527
DOI10.1142/S0217595920400187OpenAlexW3082506973MaRDI QIDQ5149527
Rui Shen, Zhiqing Meng, Min Jiang
Publication date: 11 February 2021
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595920400187
biconvex programmingKKT conditionpartial exactnesspartial optimumsmoothing partial exact penalty function
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A second-order smooth penalty function algorithm for constrained optimization problems
- Iterative identification of block-oriented nonlinear systems based on biconvex optimization
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- Preconditioned ADMM for a class of bilinear programming problems
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Calmness and Exact Penalization
- Jointly Constrained Biconvex Programming
- Optimization and nonsmooth analysis
- An exact penalty function method with global convergence properties for nonlinear programming problems
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Globally Convergent Algorithms for Convex Programming
- Non-Linear Programming Via Penalty Functions
This page was built for publication: Smoothing Partially Exact Penalty Function of Biconvex Programming