Result: A multiple penalty function method for solving Max-Bisection problems
Title:
A multiple penalty function method for solving Max-Bisection problems
Authors:
Source:
Applied mathematics and computation. 173(2):757-766
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Programmation mathématique numérique, Numerical methods in mathematical programming, Analyse numérique, Numerical analysis, Análisis numérico, Fonction pénalité, Penalty function, Función penalidad, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Problème non linéaire, Nonlinear problems, Programmation non linéaire, Non linear programming, Programación no lineal, Programmation semi définie, Semi definite programming, Programacíon semi definida, Fonction NCP, NCP function, Méthode partitionnement curcuit, Circuit partitioning method, Problème Max Bisection, Max Bisection problem, Circuit partitioning problem, Max-Bisection problem, Multiple penalty function, Semidefinite programming
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, Faculty of Science, Xi'an Jiaotong University, Xi'an 710049, China
ISSN:
0096-3003
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.17570055
Database:
PASCAL Archive
Further Information
A continuation algorithm for the solution of Max-Bisection problems is proposed in this paper. Unlike available relaxation algorithms for Max-Bisection problems, the Max-Bisection problems are converted to an equivalent continuous nonlinear programming by employing NCP functions, and the resulting nonlinear programming problem is then solved using the augmented Lagrange penalty function method. The convergence property and finite termination property of the proposed algorithm are studied, and numerical experiments and comparisons on the simple circuit partitioning problems are made. Results reported in section Numerical experiments show the algorithm generates satisfactory solutions to test problems.