DOI: 10.1007/bf01580765. The design centering problem as a D.C. programming problem

The design centering problem as a D.C. programming problem

10.1007/bf01580765

Crossref journal-article

Springer Science and Business Media LLC

Mathematical Programming (297)

Bibliography

Thach, P. T. (1988). The design centering problem as a D.C. programming problem. Mathematical Programming, 41(1â3), 229â248.

Authors 1

Phan Thien Thach (first)

References 15 Referenced 30

R.K. Brayton, S.W. Director, G.D. Hachtel and L.M. Vidigal, “A new algorithm for statistical circuit deign based on quasi-Newton methods and function splitting,”IEEE Transactions on Circuits Systems 26 (1979) 784–794. (10.1109/TCS.1979.1084701) / IEEE Transactions on Circuits Systems by R.K. Brayton (1979)
R.B. Holmes,Geometric Functional Analysis and Its Applications (Springer-Verlag, New York, Heidelberg, Berlin, 1975). (10.1007/978-1-4684-9369-6) / Geometric Functional Analysis and Its Applications by R.B. Holmes (1975)
O.L. Mangasarian and T.-H. Shiau, “A variable complexity norm maximization problem,” Technical Summary Report No. 2780, University of Wisconsin-Madison, Mathematics Research Center (Madison, WI, 1985). / “A variable complexity norm maximization problem,” Technical Summary Report No. 2780 by O.L. Mangasarian (1985)
E. Polak, “An implementable algorithm for the optimal design centering, tolerancing, and tuning problem,”Journal of Optimization Theory and Applications 37 (1982) 45–67. (10.1007/BF00934366) / Journal of Optimization Theory and Applications by E. Polak (1982)
T.-H. Shiau, “Finding the largestl p -ball in a polyhedral set,” Technical Summary Report No. 2778, University of Wisconsin-Madison, Mathematics Research Center (Madison, WI, 1984). / “Finding the largestl p -ball in a polyhedral set,” Technical Summary Report No. 2778 by T.-H. Shiau (1984)
J.J. Strodiot, V.H. Nguyen and Ng.V. Thoai, “On an optimum shape design problem,” Preprint, Facultés Universitaires de Namur, 1985.
P.T. Thach and H. Tuy, “Global optimization under Lipschitzian constraints,”Japan Journal of Applied Mathematics 4 (1987) 205–217. (10.1007/BF03167774) / Japan Journal of Applied Mathematics by P.T. Thach (1987)
T.V. Thieu, B.T. Tam and V.T. Ban, “An outer approximation method for globally minimizing a concave function over a compact convex set,” IFIP Working Conference on Recent Advances on System Modeling and Optimization (Hanoi, 1983).
H. Tuy and Ng. V. Thuong, “Minimizing a convex function over the complement of a convex set,”Methods of Operations Research 49 (1984) 85–99. / Methods of Operations Research by H. Tuy (1984)
H. Tuy, “On outer approximation methods for solving concave minimization problems,”Acta Mathematica Vietnamica 8 (1983), No. 2, 3–34. / Acta Mathematica Vietnamica by H. Tuy (1983)
H. Tuy, “Convex programs with an additional reverse convex constraint,”Journal of Optimization Theory and Applications 52 (1987) 463–486. (10.1007/BF00938217) / Journal of Optimization Theory and Applications by H. Tuy (1987)
H. Tuy, “A general deterministic approach to global optimization via d.c. programming,” presented at the ConferenceMathematics for Optimization (Toulouse, 1985). (10.1016/S0304-0208(08)72403-4)
L.M. Vidigal and S.W. Director, “A design centering algorithm for non-convex regions of acceptability,”IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems I (1982) 11–24. / IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems by L.M. Vidigal (1982)
L.M. Vidigal and S.W. Director, “Design centering: The quasiconvex, quasiconcave performance function case,”Proceedings IEEE International Symposium on Circuits and System (1980).
Z.Q. Xia, J.J. Strodiot and V.H. Nguyen, “Some optimality conditions for theC M -embedded problem with Euclidean norm,”IIASA Workshop on Nondifferentiable Optimization: Motivations and Applications (Sopron, Hungary, 1984). / IIASA Workshop on Nondifferentiable Optimization: Motivations and Applications by Z.Q. Xia (1984)

Dates

Type	When
Created	20 years, 4 months ago (April 28, 2005, 5:52 a.m.)
Deposited	5 years, 4 months ago (April 6, 2020, 11:56 p.m.)
Indexed	1 month, 3 weeks ago (July 7, 2025, 5:46 a.m.)
Issued	37 years, 3 months ago (May 1, 1988)
Published	37 years, 3 months ago (May 1, 1988)
Published Print	37 years, 3 months ago (May 1, 1988)

Funders 0

None

BibTeX

@article{Thach_1988, title={The design centering problem as a D.C. programming problem}, volume={41}, ISSN={1436-4646}, url={http://dx.doi.org/10.1007/bf01580765}, DOI={10.1007/bf01580765}, number={1–3}, journal={Mathematical Programming}, publisher={Springer Science and Business Media LLC}, author={Thach, Phan Thien}, year={1988}, month=may, pages={229–248} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2025,
        7,
        7
      ]
    ],
    "date-time": "2025-07-07T09:46:40Z",
    "timestamp": 1751881600609
  },
  "reference-count": 15,
  "publisher": "Springer Science and Business Media LLC",
  "issue": "1-3",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1988,
            5,
            1
          ]
        ],
        "date-time": "1988-05-01T00:00:00Z",
        "timestamp": 578448000000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "http://www.springer.com/tdm"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1988,
        5
      ]
    ]
  },
  "DOI": "10.1007/bf01580765",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2005,
        4,
        28
      ]
    ],
    "date-time": "2005-04-28T09:52:50Z",
    "timestamp": 1114681970000
  },
  "page": "229-248",
  "source": "Crossref",
  "is-referenced-by-count": 30,
  "title": "The design centering problem as a D.C. programming problem",
  "prefix": "10.1007",
  "volume": "41",
  "author": [
    {
      "given": "Phan Thien",
      "family": "Thach",
      "sequence": "first",
      "affiliation": []
    }
  ],
  "member": "297",
  "reference": [
    {
      "key": "CR1",
      "doi-asserted-by": "crossref",
      "first-page": "784",
      "DOI": "10.1109/TCS.1979.1084701",
      "volume": "26",
      "author": "R.K. Brayton",
      "year": "1979",
      "unstructured": "R.K. Brayton, S.W. Director, G.D. Hachtel and L.M. Vidigal, \u201cA new algorithm for statistical circuit deign based on quasi-Newton methods and function splitting,\u201dIEEE Transactions on Circuits Systems 26 (1979) 784\u2013794.",
      "journal-title": "IEEE Transactions on Circuits Systems"
    },
    {
      "key": "CR2",
      "doi-asserted-by": "crossref",
      "DOI": "10.1007/978-1-4684-9369-6",
      "volume-title": "Geometric Functional Analysis and Its Applications",
      "author": "R.B. Holmes",
      "year": "1975",
      "unstructured": "R.B. Holmes,Geometric Functional Analysis and Its Applications (Springer-Verlag, New York, Heidelberg, Berlin, 1975)."
    },
    {
      "key": "CR3",
      "volume-title": "\u201cA variable complexity norm maximization problem,\u201d Technical Summary Report No. 2780",
      "author": "O.L. Mangasarian",
      "year": "1985",
      "unstructured": "O.L. Mangasarian and T.-H. Shiau, \u201cA variable complexity norm maximization problem,\u201d Technical Summary Report No. 2780, University of Wisconsin-Madison, Mathematics Research Center (Madison, WI, 1985)."
    },
    {
      "key": "CR4",
      "doi-asserted-by": "crossref",
      "first-page": "45",
      "DOI": "10.1007/BF00934366",
      "volume": "37",
      "author": "E. Polak",
      "year": "1982",
      "unstructured": "E. Polak, \u201cAn implementable algorithm for the optimal design centering, tolerancing, and tuning problem,\u201dJournal of Optimization Theory and Applications 37 (1982) 45\u201367.",
      "journal-title": "Journal of Optimization Theory and Applications"
    },
    {
      "key": "CR5",
      "volume-title": "\u201cFinding the largestl p -ball in a polyhedral set,\u201d Technical Summary Report No. 2778",
      "author": "T.-H. Shiau",
      "year": "1984",
      "unstructured": "T.-H. Shiau, \u201cFinding the largestl p -ball in a polyhedral set,\u201d Technical Summary Report No. 2778, University of Wisconsin-Madison, Mathematics Research Center (Madison, WI, 1984)."
    },
    {
      "key": "CR6",
      "unstructured": "J.J. Strodiot, V.H. Nguyen and Ng.V. Thoai, \u201cOn an optimum shape design problem,\u201d Preprint, Facult\u00e9s Universitaires de Namur, 1985."
    },
    {
      "key": "CR7",
      "doi-asserted-by": "crossref",
      "first-page": "205",
      "DOI": "10.1007/BF03167774",
      "volume": "4",
      "author": "P.T. Thach",
      "year": "1987",
      "unstructured": "P.T. Thach and H. Tuy, \u201cGlobal optimization under Lipschitzian constraints,\u201dJapan Journal of Applied Mathematics 4 (1987) 205\u2013217.",
      "journal-title": "Japan Journal of Applied Mathematics"
    },
    {
      "key": "CR8",
      "unstructured": "T.V. Thieu, B.T. Tam and V.T. Ban, \u201cAn outer approximation method for globally minimizing a concave function over a compact convex set,\u201d IFIP Working Conference on Recent Advances on System Modeling and Optimization (Hanoi, 1983)."
    },
    {
      "key": "CR9",
      "first-page": "85",
      "volume": "49",
      "author": "H. Tuy",
      "year": "1984",
      "unstructured": "H. Tuy and Ng. V. Thuong, \u201cMinimizing a convex function over the complement of a convex set,\u201dMethods of Operations Research 49 (1984) 85\u201399.",
      "journal-title": "Methods of Operations Research"
    },
    {
      "issue": "2",
      "key": "CR10",
      "first-page": "3",
      "volume": "8",
      "author": "H. Tuy",
      "year": "1983",
      "unstructured": "H. Tuy, \u201cOn outer approximation methods for solving concave minimization problems,\u201dActa Mathematica Vietnamica 8 (1983), No. 2, 3\u201334.",
      "journal-title": "Acta Mathematica Vietnamica"
    },
    {
      "key": "CR11",
      "doi-asserted-by": "crossref",
      "first-page": "463",
      "DOI": "10.1007/BF00938217",
      "volume": "52",
      "author": "H. Tuy",
      "year": "1987",
      "unstructured": "H. Tuy, \u201cConvex programs with an additional reverse convex constraint,\u201dJournal of Optimization Theory and Applications 52 (1987) 463\u2013486.",
      "journal-title": "Journal of Optimization Theory and Applications"
    },
    {
      "key": "CR12",
      "doi-asserted-by": "crossref",
      "unstructured": "H. Tuy, \u201cA general deterministic approach to global optimization via d.c. programming,\u201d presented at the ConferenceMathematics for Optimization (Toulouse, 1985).",
      "DOI": "10.1016/S0304-0208(08)72403-4"
    },
    {
      "key": "CR13",
      "first-page": "11",
      "volume": "I",
      "author": "L.M. Vidigal",
      "year": "1982",
      "unstructured": "L.M. Vidigal and S.W. Director, \u201cA design centering algorithm for non-convex regions of acceptability,\u201dIEEE Transactions on Computer Aided Design of Integrated Circuits and Systems I (1982) 11\u201324.",
      "journal-title": "IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems"
    },
    {
      "key": "CR14",
      "unstructured": "L.M. Vidigal and S.W. Director, \u201cDesign centering: The quasiconvex, quasiconcave performance function case,\u201dProceedings IEEE International Symposium on Circuits and System (1980)."
    },
    {
      "key": "CR15",
      "volume-title": "IIASA Workshop on Nondifferentiable Optimization: Motivations and Applications",
      "author": "Z.Q. Xia",
      "year": "1984",
      "unstructured": "Z.Q. Xia, J.J. Strodiot and V.H. Nguyen, \u201cSome optimality conditions for theC M -embedded problem with Euclidean norm,\u201dIIASA Workshop on Nondifferentiable Optimization: Motivations and Applications (Sopron, Hungary, 1984)."
    }
  ],
  "container-title": "Mathematical Programming",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BF01580765.pdf",
      "content-type": "application/pdf",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/article/10.1007/BF01580765/fulltext.html",
      "content-type": "text/html",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "http://link.springer.com/content/pdf/10.1007/BF01580765",
      "content-type": "unspecified",
      "content-version": "vor",
      "intended-application": "similarity-checking"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2020,
        4,
        7
      ]
    ],
    "date-time": "2020-04-07T03:56:35Z",
    "timestamp": 1586231795000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "http://link.springer.com/10.1007/BF01580765"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1988,
        5
      ]
    ]
  },
  "references-count": 15,
  "journal-issue": {
    "issue": "1-3",
    "published-print": {
      "date-parts": [
        [
          1988,
          5
        ]
      ]
    }
  },
  "alternative-id": [
    "BF01580765"
  ],
  "URL": "http://dx.doi.org/10.1007/BF01580765",
  "relation": {},
  "ISSN": [
    "0025-5610",
    "1436-4646"
  ],
  "subject": [],
  "container-title-short": "Mathematical Programming",
  "published": {
    "date-parts": [
      [
        1988,
        5
      ]
    ]
  }
}