An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
type: Item
instance of: scholarly article
title: An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
zbMATH Open document ID: 1328.90144
published in: Journal of Industrial and Management Optimization
publication date: 2015-12-18T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 49M20
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6522366
zbMATH Keywords: nonlinear programming
zbMATH Keywords: lower-order penalty function
zbMATH Keywords: quadratic relaxation
zbMATH Keywords: constraint qualification
zbMATH Keywords: primal-dual interior-point method
author: Boshi Tian
author: Xiao Qi Yang
author: Kaiwen Meng
describes a project that uses: Ipopt
MaRDI profile type: Publication
full work available at URL: jimo.2016.12.949
OpenAlex ID: W2525179912
cites work: Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
cites work: A line search exact penalty method using steering rules
cites work: Steering exact penalty methods for nonlinear programming
cites work: Restricted isometry properties and nonconvex compressive sensing
cites work: Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: A primal-dual trust-region algorithm for non-convex nonlinear programming
cites work: A penalty-interior-point algorithm for nonlinear constrained optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: On the Newton interior-point method for nonlinear programming problems
cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming
cites work: Q4226179
cites work: Q4739659
cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
cites work: Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
cites work: A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
cites work: A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
cites work: Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
cites work: Mathematical Programs with Equilibrium Constraints
cites work: A robust SQP method based on a smoothing lower order penalty function†
cites work: First- and second-order necessary conditions via exact penalty functions
cites work: Optimality Conditions via Exact Penalty Functions
cites work: On the smoothing of the square-root exact penalty function for inequality constrained optimization
cites work: Automatic decrease of the penalty parameter in exact penalty function methods
cites work: Interior-point methods for optimization
cites work: Q5491447
cites work: Interior Point Methods for Nonlinear Optimization
cites work: Variational Analysis
cites work: Decreasing Functions with Applications to Penalization
cites work: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
cites work: Optimality conditions in smooth nonlinear programming
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Q5691079
cites work: Lagrange Multipliers and Calmness Conditions of Order p
cites work: Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
cites work: Q4382667
DOI: 10.3934/JIMO.2016.12.949
description: scientific article; zbMATH DE number 6522366