See this document in CiteSeerX!

Reformulation and Convex Relaxation Techniques for Global Optimization (2004)  (Make Corrections)  (3 citations)
Leo Sergio Liberti



  Home/Search   Context   Related

 
View or download:
lix.polytechnique.fr/...phdthesis.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  lix.polytechnique....publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Many engineering optimization problems can be formulated as nonconvex nonlinear programming problems (NLPs) involving a nonlinear objective function subject to nonlinear constraints. Such problems may exhibit more than one locally optimal point. However, one is often solely or primarily interested in determining the globally optimal point. This thesis is concerned with techniques for establishing such global optima using spatial Branch-and-Bound (sBB) algorithms. (Update)

Cited by:   More
Variable Neighbourhood Search for the Global Optimization of.. - Liberti, Drazic (2005)   (Correct)
Computational Experience With The Molecular Distance Geometry.. - Lavor, al.   (Correct)
The Kissing Number Problem: A New Result from Global.. - Liberti, Maculan, al. (2004)   (Correct)

Active bibliography (related documents):   More   All
2.5:   Global Optimization of Mixed-Integer Nonlinear Problems - Adjiman, Androulakis, Floudas   (Correct)
2.3:   An exact reformulation algorithm for large nonconvex NLPs.. - Liberti, Pantelides (2005)   (Correct)
2.3:   Linearity Embedded in Nonconvex Programs - Liberti (2002)   (Correct)

Similar documents based on text:   More   All
0.3:   Reduction Constraints for the Global Optimization of NLPs - Liberti (2002)   (Correct)
0.3:   Reformulation and Convex Relaxation Techniques for Global.. - Liberti (2004)   (Correct)
0.1:   Comparison of Deterministic and Stochastic Approaches to.. - Liberti, Kucherenko   (Correct)

Related documents from co-citation:   More   All
3:   Centre for Process Systems Engineering (context) - Liberti, Tsiakis et al. - 2001
3:   Application of Deterministic Low-discrepancy Sequences to Nonlinear Global Optim.. (context) - Kucherenko - 2003
2:   Variable Neighbourhood Search: Principles and applications (context) - Hansen, Mladenovic - 2001

BibTeX entry:   (Update)

Liberti, L., Reformulation and Convex Relaxation Techniques for Global Optimization, Ph.D. Thesis, Imperial College London, March, 2004 4 http://citeseer.ist.psu.edu/article/liberti04reformulation.html   More

@misc{ liberti04reformulation,
  author = "L. Liberti",
  title = "Reformulation and Convex Relaxation Techniques for Global Optimization",
  text = "Liberti, L., Reformulation and Convex Relaxation Techniques for Global
    Optimization, Ph.D. Thesis, Imperial College London, March, 2004 4",
  year = "2004",
  url = "citeseer.ist.psu.edu/article/liberti04reformulation.html" }
Citations (may not include all citations):
1002   Programming Language (context) - Stroustrup - 1999
686   Practical Methods of Optimization (context) - Fletcher - 1991
640   Princeton University Press (context) - Rockafellar - 1970
482   Iterative Solution of Nonlinear Equations in Several Variabl.. (context) - Ortega, Rheinboldt - 1970
474   Graph Theory (context) - Harary - 1971
452   Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1983
276   Linear Programming and Extensions (context) - Dantzig - 1963
262   Global Optimization Using Interval Analysis (context) - Hansen - 1992
201   Nonlinear Programming: Theory and Algorithms (context) - Bazaraa, Sherali et al. - 1993
172   Nonlinear Programming: Sequential Unconstrained Minimization.. (context) - Fiacco, McCormick - 1968
105   Distributed optimization by ant colonies (context) - Colorni, Dorigo et al. - 1991
86   Integer Programming (context) - Wolsey - 1998
75   Global Optimization (context) - Torn, Zilinskas - 1989
71   Handbook of Global Optimization (context) - Horst, Pardalos - 1995
64   Global Optimization: Deterministic Approaches (context) - Horst, Tuy - 1996
64   Global Optimization: Deterministic Approaches (context) - Horst, Tuy - 1990
58   User's Manual (context) - CPLEX - 2002
57   Constrained Global Optimization: Algorithms and Applications (context) - Pardalos, Rosen - 1987
48   Varieties and Algorithms (context) - Cox, Little et al. - 1997
39   The maximum clique problem - Bomze, Budinich et al.
38   Complementarity problems (context) - Pang
35   Computability of global solutions to factorable nonconvex pr.. (context) - McCormick - 1976
30   A new reformulation-linearization technique for bilinear pro.. (context) - Sherali, Alameddine - 1992
29   On algorithms for obtaining a maximum transversal (context) - Duff - 1981
29   The consistent initialization of differential-algebraic syst.. (context) - Pantelides - 1988
24   Global optimization of nonconvex NLPs and MINLPs with applic.. (context) - Ryoo, Sahinidis - 1995
24   An algorithm for separable nonconvex programming problems (context) - Falk, Soland - 1969
24   An algorithm for separable nonconvex programming problems ii.. (context) - Soland - 1971
23   Differential evolution -- a simple and efficient heuristic f.. (context) - Storn, Price - 1997
22   New properties and computational improvement of the gop algo.. - Visweswaran, Floudas - 1993
20   Mathematical Thought from Ancient to Modern Times (context) - Kline - 1972
19   North Holland (context) - Kunen - 1980
19   Special facilities in a general mathematical programming sys.. (context) - Beale, Tomlin - 1970
19   Rigorous convex underestimators for general twicedifferentia.. - Adjiman, Floudas - 1996
16   Jointly constrained biconvex programming (context) - Al-Khayyal, Falk - 1983
16   Checking local optimality in constrained quadratic programmi.. (context) - Pardalos, Schnitger - 1988
14   A Reformulation-Linearization Technique for Solving Discrete.. (context) - Sherali, Adams - 1999
11   Analytical approach to global optimization (context) - Hansen, Jaumard et al. - 1988
10   Systems Optimization Laboratory (context) - Gill, for - 1999
10   On standard quadratic optimization problems (context) - Bomze - 1998
10   A branch-and-reduce approach to global optimization (context) - Ryoo, Sahinidis - 1996
10   symbolic reformulationspatial branch and bound algorithm glo.. (context) - Pantelides, spatial et al. - 1999
9   Global optimization of MINLP problems (context) - Adjiman, Androulakis et al. - 1997
9   New formulations and branching strategies for the gop algori.. - Visweswaran, Floudas
9   the Optimal Design of Continuous Processes (context) - Smith - 1996
9   A Lagrangian approach to the pooling problem (context) - Adhya, Tawarmalani et al. - 1956
8   A global optimization method (context) - Adjiman, Androulakis et al. - 1996
7   Global optimisation of nonconvex MINLPs (context) - Smith, Pantelides - 1997
7   Global optimization of nonconvex mixed-integer nonlinearprog.. (context) - Kocis, Grossmann - 1988
7   Centre for Process Systems Engineering (context) - Liberti, Tsiakis et al. - 2001
7   New constrained optimization reformulation of complementarit.. (context) - Fischer - 1998
7   Global Optimization in Engineering Design (context) - Grossmann - 1996
7   Global minimization by reducing the duality gap (context) - Ben-Tal, Eiger et al. - 1994
6   Convergence and restart in branch-and-bound algorithms for g.. (context) - Tuy, Horst - 1988
6   Global optimization of nonconvex factorable programming prob.. (context) - Sherali, Wang - 2001
6   A general-class of branch-and-bound methods in global optimi.. (context) - Horst - 1986
6   A branch and contract algorithm for problems with concave un.. (context) - Zamora, Grossmann - 1999
5   Concave minimization: Theory (context) - Benson
5   A bilinear approach to the pooling problem (context) - Foulds, Haughland et al. - 1992
5   methods and algorithms (context) - Tuy, optimization
5   Global optimization of nonconvex polynomial programming prob.. (context) - Sherali - 1998
5   Deterministic global optimization with partition sets whose .. (context) - Horst - 1988
4   Global optimization of mixed integer nonlinear programs: A t.. - Tawarmalani, Sahinidis - 1999
4   Axiomatic characterization of a global optimization algorith.. (context) - Zilinskas - 1985
4   Global optimization of nonconvex MINLPs by interval analysis (context) - Vaidyanathan, El-Halwagi
4   Global Optimization of Nonconvex Nonlinear Programs using Pa.. - Epperly - 1995
4   A reduced space branch and bound algorithm for global optimi.. (context) - Epperly, Pistikopoulos - 1997
4   Two-phase methods for global optimization (context) - Schoen
4   Baron: Branch and reduce optimization navigator: User's manu.. (context) - Sahinidis - 1999
4   Parallel search algorithms in global optimization (context) - Pardalos - 1989
4   Computing global minima to polynomial optimization problems .. (context) - Hagglof, Lindberg et al. - 1995
4   BB: A global optimization method for general constrained non.. (context) - Androulakis, Maranas et al. - 1995
4   Heuristic algorithms for the unconstrained binary quadratic .. - Beasley - 1998
4   Handbook of Global Optimization (context) - Pardalos, Romeijn - 2002
4   Convex envelopes of monomials of odd degree - Liberti, Pantelides - 2003
4   Mixed-integer nonlinear optimization (context) - Adjiman, Schweiger et al. - 1998
3   Efficiency of a global optimization algorithm (context) - Ratschek, Rokne - 1987
3   Global Optimization with Non-Convex Constraints (context) - Strongin - 2000
3   An extended cutting plane method for a class of non-convex M.. (context) - Westerlund, Skrifvars et al. - 1998
3   Optimization by direct search and systematic reduction of th.. (context) - Luus, Jaakola - 1973
3   a new class of bilevel programming problems and its use for .. - Frangioni - 1995
3   Theory and Algorithms (context) - Korte, Vygen - 2000
3   Th eorie des fonctions analytiques (context) - Lagrange
3   Discrete Mathematics with Graph Theory (context) - Goodaire, Parmenter - 1998
3   Global constrained optimization using interval analysis (context) - Hansen - 1980
3   Global Optimization Techniques for Process Systems Engineeri.. (context) - Adjiman - 1998
3   for general twice-differentiable constrained NLPs (context) - Adjiman, Dallwig et al. - 1998
3   for general twice-differentiable constrained NLPs: II (context) - Adjiman, Androulakis et al. - 1998
3   A finite algorithm for global minimization of separable conc.. (context) - Shectman, Sahinidis - 1998
3   Handbook of Combinatorial Optimization (context) - Du, Pardalos - 1998
3   On finding new vertices and redundant constraints in cutting.. (context) - Horst, Devries et al. - 1988
2   Deterministic Global Optimization (context) - Floudas - 2000
2   A parallel global optimization algorithm for rational separa.. (context) - Ge - 1989
2   Finding all solutions to nonlinearly constrained systems of .. (context) - Maranas, Floudas - 1995
2   A global optimization algorithm based on the process of evol.. (context) - Hirafuji, Hagan - 2000
2   The Mathematics of Physics and Chemistry (context) - Margenau, Murphy - 1956
2   Generalized branch-and-cut framework for mixed-integer nonli.. (context) - Kesavan, Barton - 2000
2   Algorithms for multi-extremal mathematical programming porbl.. (context) - Strongin - 1992
2   Exact algorithms for global optimization of mixedinteger non.. (context) - Tawarmalani, Sahinidis
2   A tight linearization and an algorithm for 0-1 quadratic pro.. (context) - Sherali, Adams - 1986
2   Tabu search applied to global optimization (context) - Chelouah, Siarry - 2000
2   Set Theory for the Working Mathematician (context) - Ciesielski - 1997
2   A method for converting a class of univariate functions into.. (context) - Lamar - 1999
2   Record breaking optimization results using the ruin and recr.. (context) - Schrimpf, Schneider et al. - 2000
2   A global optimization algorithm using adaptive random search (context) - Masri, Bekey et al. - 1980
2   On finitely terminating branch-and-bound algorithms for some.. (context) - Al-Khayyal, Sherali - 2000
2   Kluwer Academic Publishers (context) - Tuy, Global - 1998
2   Enumerative techniques for solving some nonconvex global opt.. (context) - Pardalos - 1988
2   Efficient and adaptive lagrange-multiplier methods for nonli.. - Wah, Wang - 1999
2   Convexification of different classes of nonconvex MINLP prob.. (context) - Porn, Harjunkoski et al. - 1999
2   Mathematical modeling of a parallel global optimization algo.. (context) - Eskow, Schnabel - 1989
2   Local convexification of the lagrangian function in nonconve.. (context) - Li, Sun - 2000
1   Efficient domain partitioning algorithms for global optimiza.. (context) - Meewella, Mayne - 1989
1   Semidefinite relaxations of fractional programming via novel.. (context) - Tawarmalani, Sahinidis - 2001
1   Convex extensions and envelopes of semi-continuous functions (context) - Tawarmalani, Sahinidis - 2002
1   Convexification and global optimization of the pooling probl.. (context) - Tawarmalani, Sahinidis - 2002
1   Solving pseudo-convex mixed integer optimization problems by.. (context) - Westerlund, Porn - 2002
1   Reduced first-level representations via the reformulation-li.. (context) - Sherali, Smith et al. - 2000
1   Dynamic tunnelling algorithm for global optimization (context) - Yao - 1989
1   ACM SIGNUM Newsletter (context) - Brook, Kendrick et al. - 1988
1   Global optimisation with space-filling curves (context) - Goertzel - 1999
1   On consistency of bounding operations in deterministic globa.. (context) - Horst - 1989
1   An automated modeling and reformulation system for design op.. (context) - Amarger, Biegler et al. - 1992
1   Global optimization: Quantum thermal annealing with path int.. (context) - Lee, Berne - 2000
1   Convexification and existence of a saddle point in a pth-pow.. (context) - Li, Sun - 2001
1   Performance comparison of function evaluation methods (context) - Liberti
1   Interval analysis in automated design for bounded solutions (context) - O'Grady, Bogle et al. - 2001
1   Process Systems Enterprise (context) - Enterprise, Introductory - 2003
1   Global optimization of multiplicative programs (context) - Ryoo, Sahinidis - 2003
1   Ant colony approach to continuous function optimization (context) - Mathur, Karale et al. - 2000
1   Computational Mathematics and Mathematical Physics (context) - Strekalovsky, with et al. - 2001
1   the convergence of an algorithm for finding a global extremu.. (context) - Strongin - 1973
1   Evaluation ranges of functions using balanced random interva.. (context) - Zilinskas, Bogle - 2003
1   Global optimization on convex sets (context) - Pinter - 1986
1   Object-Oriented Programming Languages (context) - Salus - 1998
1   Algorithms for global optimization and discrete problems bas.. (context) - Murray, Ng
1   An algorithm for global optimization of lipschitz continuous.. (context) - Meewella, Mayne - 1988
1   A multivariate global optimization using linear bounding fun.. (context) - Wang, Change - 1998
1   Automated reformulation of disjunctive constraints in MINLP .. (context) - Bjorkqvist, Westerlund - 1999
1   On simulated annealing and nested annealing (context) - Rajasekaran - 2000
1   second edition (context) - Stewart, Chapman et al. - 1989
1   Converting general nonlinear programming problems to separab.. (context) - McCormick - 1972
1   Mixed integer linearnonlinear programming interface specific.. (context) - Tsiakis, integer et al. - 2002
1   On global optimality conditions for d (context) - Strekalovsky - 1997
1   A new algorithm for generating space-filling curves (context) - Fischer - 1986

Documents on the same site (http://www.lix.polytechnique.fr/~liberti/publications.html):   More
The Kissing Number Problem: A New Result from Global.. - Liberti, Maculan, al. (2004)   (Correct)
Reformulation and Convex Relaxation Techniques for Global.. - Liberti (2004)   (Correct)
Comparison of Deterministic and Stochastic Approaches to.. - Liberti, Kucherenko   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC