Nonlinear programming without a penalty function or a filter

Nonlinear programming without a penalty function or a filter

A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a barrier or a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonl...

Descrizione completa

Dettagli Bibliografici
Autori principali:	Gould, N, Toint, P
Natura:	Report
Pubblicazione:	Unspecified 2007

Documenti analoghi

On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming.
di: Cartis, C, et al.
Pubblicazione: (2011)

Objective penalty function method for nonlinear programming with inequality constraints
di: Zhuolin Yan, et al.
Pubblicazione: (2024-11-01)

On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
di: Cartis, C, et al.
Pubblicazione: (2015)

On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
di: Cartis, C, et al.
Pubblicazione: (2013)

On the complexity of finding first-order critical points in constrained nonlinear optimization
di: Cartis, C, et al.
Pubblicazione: (2012)

An Efficient Penalty Method without a Line Search for Nonlinear Optimization
di: Assma Leulmi
Pubblicazione: (2024-03-01)

Corrigendum: On the complexity of finding first-order critical points in constrained nonlinear optimization
di: Cartis, C, et al.
Pubblicazione: (2016)

Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
di: Cartis, C, et al.
Pubblicazione: (2017)

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
di: Cartis, C, et al.
Pubblicazione: (2019)

Generalized logarithmic penalty function method for solving smooth nonlinear programming involving invex functions
di: Mansur Hassan, et al.
Pubblicazione: (2019-01-01)

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares.
di: Bellavia, S, et al.
Pubblicazione: (2010)

A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function.
di: Cartis, C, et al.
Pubblicazione: (2013)

Partial Exactness for the Penalty Function of Biconvex Programming
di: Min Jiang, et al.
Pubblicazione: (2021-01-01)

New Exact Penalty Functions for Nonlinear Constrained Optimization Problems
di: Bingzhuang Liu, et al.
Pubblicazione: (2014-01-01)

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
di: Cartis, C, et al.
Pubblicazione: (2012)

Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity.
di: Cartis, C, et al.
Pubblicazione: (2011)

A new logarithmic penalty function approach for nonlinear constrained optimization problem
di: Mansur Hassan, et al.
Pubblicazione: (2019-04-01)

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
di: Cartis, C, et al.
Pubblicazione: (2019)

Payments and penalties in ecosystem services programs
di: Kim, Y, et al.
Pubblicazione: (2024)

Generalized Logarithmic Penalty Function Approach For Invex Nonlinear Constrained Optimization And Its Application
di: Hassan, Mansur
Pubblicazione: (2020)

Analytical Approach for Linear Programming Using Barrier and Penalty Function Methods
di: Moengin, Parwadi
Pubblicazione: (2003)

Convergence of exponential penalty function method for multiobjective fractional programming problems
di: Anurag Jayswal, et al.
Pubblicazione: (2014-12-01)

Adaptive cubic overestimation methods for unconstrained optimization
di: Cartis, C, et al.
Pubblicazione: (2007)

Adaptive cubic overestimation methods for unconstrained optimization
di: Cartis, C, et al.
Pubblicazione: (2007)

On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
di: Cartis, C, et al.
Pubblicazione: (2012)

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
di: Cartis, C, et al.
Pubblicazione: (2010)

Trust-region and other regularisations of linear least-squares problems
di: Cartis, C, et al.
Pubblicazione: (2008)

Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results.
di: Cartis, C, et al.
Pubblicazione: (2011)

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
di: Cartis, C, et al.
Pubblicazione: (2012)

Complexity bounds for second-order optimality in unconstrained optimization.
di: Cartis, C, et al.
Pubblicazione: (2012)

Universal regularization methods: varying the power, the smoothness and the accuracy
di: Cartis, C, et al.
Pubblicazione: (2019)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
di: Cartis, C, et al.
Pubblicazione: (2017)

Trust-region and other regularisations of linear least-squares problems
di: Cartis, C, et al.
Pubblicazione: (2009)

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
di: Cartis, C, et al.
Pubblicazione: (2020)

On the Convergence of a Smooth Penalty Algorithm without Computing Global Solutions
di: Bingzhuang Liu, et al.
Pubblicazione: (2012-01-01)

A path-following algorithm for linear programming using quadratic and logarithmic penalty functions
Pubblicazione: (2003)

Logarithmic penalty function method for invex multi-objective fractional programming problems
di: Mansur Hassan, et al.
Pubblicazione: (2020-01-01)

Penalty method for a class of differential nonlinear system arising in contact mechanics
di: Xu Chu, et al.
Pubblicazione: (2022-07-01)

Parameter Identification in Nonlinear Mechanical Systems with Noisy Partial State Measurement Using PID-Controller Penalty Functions
di: R. Manikantan, et al.
Pubblicazione: (2020-07-01)

The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints
di: Yukuan Hu, et al.
Pubblicazione: (2024-11-01)