Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
From MaRDI portal
Publication:824593
DOI10.1186/s13660-018-1723-xzbMath1497.90196OpenAlexW2808280572WikidataQ55423588 ScholiaQ55423588MaRDI QIDQ824593
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1723-x
inequality constrained optimizationsmoothing methodexact penalty functionlower order penalty function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Linear equations (linear algebraic aspects) (15A06)
Related Items
A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality, Smoothing Approximation to the New Exact Penalty Function with Two Parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Feasibility-solvability theorems for generalized vector equilibrium problem in reflexive Banach spaces
- Computing power system parameters to maximize the small signal stability margin based on min-max models
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Smoothing of the lower-order exact penalty function for inequality constrained optimization
- A superlinearly convergent projection method for constrained systems of nonlinear equations
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- Z-eigenvalue methods for a global polynomial optimization problem
- A globally convergent algorithm for exact penalty functions
- A collection of test problems for constrained global optimization algorithms
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
- Smoothing approximation to the square-order exact penalty functions for constrained optimization
- A simple smooth exact penalty function for smooth optimization problem
- Smoothing approximation to \(l_1\) exact penalty function for inequality constrained optimization
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- Quadratic smoothing approximation to \(l_{1}\) exact penalty function in global optimazation
- Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- An exact lower order penalty function and its smoothing in nonlinear programming
- The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems
- Non-Linear Programming Via Penalty Functions
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres
