An objective penalty function-based method for inequality constrained minimization problem

DOI10.1155/2018/7484256zbMath1427.90266OpenAlexW2805250513MaRDI QIDQ1721383

Shujun Lian, Sitong Meng, Y. J. Wang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/7484256

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items

Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem

Cites Work

• Unnamed Item
• Existence-stability theorems for strong vector set-valued equilibrium problems in reflexive Banach spaces
• An \(H\)-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
• A second-order smooth penalty function algorithm for constrained optimization problems
• Generalized strict feasibility and solvability for generalized vector equilibrium problem with set-valued map in reflexive Banach spaces
• A new objective penalty function approach for solving constrained minimax problems
• \(Z\)-eigenvalue inclusion theorems for tensors
• Criteria for strong \(H\)-tensors
• Column sufficient tensors and tensor complementarity problems
• Smoothing of the lower-order exact penalty function for inequality constrained optimization
• An objective penalty function method for nonlinear programming.
• Smoothing approximation to the square-order exact penalty functions for constrained optimization
• A simple smooth exact penalty function for smooth optimization problem
• A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
• Gradient-free method for nonsmooth distributed optimization
• Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
• A new \(CQ\) method for solving split feasibility problem
• Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
• Exactness and algorithm of an objective penalty function
• A family of conjugate gradient methods for large-scale nonlinear equations
• Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
• Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
• A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
• Exact penalty functions and stability in locally Lipschitz programming
• Exact penalty functions in nonlinear programming
• Numerical Optimization
• An exact lower order penalty function and its smoothing in nonlinear programming
• Exact Penalty Functions in Constrained Optimization
• Optimization by Least Squares
• Non-Linear Programming Via Penalty Functions
• Convergence analysis of a block improvement method for polynomial optimization over unit spheres