An objective penalty function-based method for inequality constrained minimization problem
From MaRDI portal
Publication:1721383
Summary: For inequality constrained minimization problem, we first propose a new exact nonsmooth objective penalty function and then apply a smooth technique to the penalty function to make it smooth. It is shown that any minimizer of the smoothing objective penalty function is an approximated solution of the original problem. Based on this, we develop a solution method for the inequality constrained minimization problem and prove its global convergence. Numerical experiments are provided to show the efficiency of the proposed method.
Recommendations
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- An objective penalty function method for nonlinear programming.
- scientific article; zbMATH DE number 1399490
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
Cites work
- \(Z\)-eigenvalue inclusion theorems for tensors
- A family of conjugate gradient methods for large-scale nonlinear equations
- A new \(CQ\) method for solving split feasibility problem
- A new objective penalty function approach for solving constrained minimax problems
- A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric tensor
- A second-order smooth penalty function algorithm for constrained optimization problems
- A simple smooth exact penalty function for smooth optimization problem
- A smoothing inexact Newton method for \(P_0\) nonlinear complementarity problem
- An H-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
- An exact lower order penalty function and its smoothing in nonlinear programming
- An objective penalty function method for nonlinear programming.
- Column sufficient tensors and tensor complementarity problems
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
- Criteria for strong H-tensors
- Exact penalty functions and stability in locally Lipschitz programming
- Exact Penalty Functions in Constrained Optimization
- Exact penalty functions in nonlinear programming
- Exactness and algorithm of an objective penalty function
- Existence-stability theorems for strong vector set-valued equilibrium problems in reflexive Banach spaces
- Generalized Levitin-Polyak well-posedness for generalized semi-infinite programs
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- Generalized strict feasibility and solvability for generalized vector equilibrium problem with set-valued map in reflexive Banach spaces
- Gradient-free method for nonsmooth distributed optimization
- scientific article; zbMATH DE number 3862950 (Why is no real title available?)
- Non-Linear Programming Via Penalty Functions
- Numerical Optimization
- Optimization by Least Squares
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- Smoothing approximation to l₁ exact penalty function for inequality constrained optimization
- Smoothing approximation to the square-order exact penalty functions for constrained optimization
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
Cited in
(11)- A new computational method for the functional inequality constrained minimax optimization problem
- An objective penalty function method for nonlinear programming.
- Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem
- Exactness and algorithm of an objective penalty function
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- A modified penalty function method for minimization with inequality constraints
- A new objective penalty function approach for solving constrained minimax problems
- scientific article; zbMATH DE number 1399490 (Why is no real title available?)
- An adaptive penalty method for inequality constrained minimization problems
- A new exact penalty function method for continuous inequality constrained optimization problems
- Inexact exponential penalty function with the augmented Lagrangian for multiobjective optimization algorithms
This page was built for publication: An objective penalty function-based method for inequality constrained minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1721383)
