NDLI: Extended duality for nonlinear programming

Content Provider	Springer Nature Link
Author	Chen, Yixin Chen, Minmin
Copyright Year	2008
Abstract	Duality is an important notion for nonlinear programming (NLP). It provides a theoretical foundation for many optimization algorithms. Duality can be used to directly solve NLPs as well as to derive lower bounds of the solution quality which have wide use in other high-level search techniques such as branch and bound. However, the conventional duality theory has the fundamental limit that it leads to duality gaps for nonconvex problems, including discrete and mixed-integer problems where the feasible sets are generally nonconvex.In this paper, we propose an extended duality theory for nonlinear optimization in order to overcome some limitations of previous dual methods. Based on a new dual function, the extended duality theory leads to zero duality gap for general nonconvex problems defined in discrete, continuous, and mixed spaces under mild conditions. Comparing to recent developments in nonlinear Lagrangian functions and exact penalty functions, the proposed theory always requires lesser penalty to achieve zero duality. This is very desirable as the lower function value leads to smoother search terrains and alleviates the ill conditioning of dual optimization.Based on the extended duality theory, we develop a general search framework for global optimization. Experimental results on engineering benchmarks and a sensor-network optimization application show that our algorithm achieves better performance than searches based on conventional duality and Lagrangian theory.
Starting Page	33
Ending Page	59
Page Count	27
File Format	PDF
ISSN	09266003
Journal	Computational Optimization and Applications
Volume Number	47
Issue Number	1
e-ISSN	15732894
Language	English
Publisher	Springer US
Publisher Date	2008-09-20
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Nonlinear programming Global optimization Duality gap Extended duality Convex and Discrete Geometry Statistics Operations Research/Decision Theory Operations Research, Mathematical Programming Optimization
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Control and Optimization Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A recursive algorithm for nonlinear least-squares problems

Canonical dual least square method for solving general nonlinear systems of quadratic equations

Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation

Global error bounds for the extended vertical LCP

Discrete Filled Function Method for Discrete Global Optimization

An algorithm for nonlinear optimization problems with binary variables

A Class of Augmented Filled Functions

Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization

A new hybrid method for nonlinear complementarity problems

Extended duality for nonlinear programming

Similar Documents

A recursive algorithm for nonlinear least-squares problems

Canonical dual least square method for solving general nonlinear systems of quadratic equations

Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation

Global error bounds for the extended vertical LCP

Discrete Filled Function Method for Discrete Global Optimization

An algorithm for nonlinear optimization problems with binary variables

A Class of Augmented Filled Functions

Nonlinear Rescaling as Interior Quadratic Prox Method in Convex Optimization

A new hybrid method for nonlinear complementarity problems

Extended duality for nonlinear programming