Approximate Optimal Solutions and Nonlinear Lagrangian Functions*

Authors:
X. X. Huang;X. Q. Yang
Affiliations:
Department of Mathematics and Computer Science, Chongqing Normal University, Chongqing 400047, China. Current address: Department of Applied Mathematics, Hong Kong Polytechnic University, Kowloon, ...;Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong (e-mail: mayangxq@polyu.edu.hk)
Venue:
Journal of Global Optimization
Year:
2001

Citing 6
Cited 0

&egr;-duality theorem of nondifferentiable nonconvex multiobjective programming

Journal of Optimization Theory and Applications
&egr;-optimality criteria for convex programming problems via exact penalty functions

Mathematical Programming: Series A and B
Value-estimation function method for constrained global optimization

Journal of Optimization Theory and Applications
A Nonlinear Lagrangian Approach to Constrained Optimization Problems

SIAM Journal on Optimization
Decreasing Functions with Applications to Penalization

SIAM Journal on Optimization
Successive Optimization Method via Parametric Monotone Composition Formulation

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is an increasing interest in the study of optimality conditions of approximate solutions for nonlinear optimization problems. In this paper, relationships between approximate optimal values and approximate roots of a nonlinear function are explored via a nonlinear Lagrangian function. Almost approximate optimal solutions are investigated by means of nonlinear Lagrangian functions.