The <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math> exact <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>G</mml:mi></mml:math>-penalty function method and <mml:math altimg="si3.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>G</mml:mi></mml:math>-invex mathematical programming problems-Reference-Cited by-同舟云学术

The l1 exact G-penalty function method and G-invex mathematical programming problems

Published:2011-11 Issue:9-10 Volume:54 Page:1966-1978
ISSN:0895-7177
Container-title:Mathematical and Computer Modelling
language:en
Short-container-title:Mathematical and Computer Modelling

Author:

Antczak Tadeusz

Publisher

Elsevier BV

Subject

Computer Science Applications,Modeling and Simulation

Reference18 articles.

1. Necessary and sufficient conditions for a penalty method to be exact;Bertsekas;Mathematical Programming,1975

2. Exact penalty functions in nonlinear programming;Evans;Mathematical Programming,1973

3. Exact penalty functions in constrained optimization;Di Pillo;SIAM Journal of Control and Optimization,1989

4. Nonlinear programming via penalty functions;Zangwill;Management Science,1967

5. An exact potential method for constrained maxima;Pietrzykowski;SIAM Journal of Numerical Analysis,1969

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the exact $$l_{1}$$ penalty function method for convex nonsmooth optimization problems with fuzzy objective function;Soft Computing;2022-09-07

2. G-penalty approach for multi-dimensional control optimisation problem with nonlinear dynamical system;International Journal of Control;2022-02-04

3. Modified Courant-Beltrami penalty function and its convergence;PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation;2019

4. The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming;Optimization Letters;2015-11-14