{"id":{"repo_id":"nus","oai_identifier":"oai:scholarbank.nus.edu.sg:10635/14510"},"canonical_url":"https://search.dev.ndltd.org/etd/nus/oai:scholarbank.nus.edu.sg:10635/14510","repository":{"repo_id":"nus","name":"National University of Singapore","base_url":"https://scholarbank.nus.edu.sg/oai/request"},"display":{"title":"Smooth convex approximation and its applications","abstract":"In this thesis, we consider a smooth convex approximation to the sum of the $\\kappa$ largest components. To make it applicable to a wide class of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex function. By using the composite property of $g_{\\kappa}(\\varepsilon; \\cdot)$ and eigenvalue function $\\Lambda(X)$, we find the smooth approximate function to the sum of the $\\kappa$ largest eigenvalue function.","abstract_html":"In this thesis, we consider a smooth convex approximation to the sum of the $\\kappa$ largest components. To make it applicable to a wide class of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex function. By using the composite property of <span class=\"etd-inline-math\">g<sub>\\kappa</sub>(\\varepsilon; \\cdot)</span> and eigenvalue function $\\Lambda(X)$, we find the smooth approximate function to the sum of the $\\kappa$ largest eigenvalue function.","abstract_has_math":true,"creators":["SHI SHENGYUAN"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2005,"date_issued":"2005-01-31","date_published":"2005-01-31","updated_at":"2026-07-24T03:32:43Z","subjects":["convex optimization, non-smooth optimization, semismooth function, sum of eigenvalues"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["SHI SHENGYUAN"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2005-01-31"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://scholarbank.nus.edu.sg/handle/10635/14510"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["convex optimization, non-smooth optimization, semismooth function, sum of eigenvalues"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://scholarbank.nus.edu.sg/bitstreams/1a51b3b7-6314-45d8-ad50-06aa6a205076/download"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we consider a smooth convex approximation to the sum of the $\\kappa$ largest components. To make it applicable to a wide class of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex function. By using the composite property of $g_{\\kappa}(\\varepsilon; \\cdot)$ and eigenvalue function $\\Lambda(X)$, we find the smooth approximate function to the sum of the $\\kappa$ largest eigenvalue function."]},{"key":"dc:format.checksum.md5","label":"Dc Format Checksum Md5","values":["0e4f40e3f9d44c530275cce6aeb7ca2b","67d20f9a2370882497edf3156209879e"]},{"key":"dc:title","label":"Title","values":["Smooth convex approximation and its applications"]}]}],"canonical_facts":{"dc:creator":["SHI SHENGYUAN"],"dc:date.issued":["2005-01-31"],"dc:description.abstract":["In this thesis, we consider a smooth convex approximation to the sum of the $\\kappa$ largest components. To make it applicable to a wide class of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex function. By using the composite property of $g_{\\kappa}(\\varepsilon; \\cdot)$ and eigenvalue function $\\Lambda(X)$, we find the smooth approximate function to the sum of the $\\kappa$ largest eigenvalue function."],"dc:format.checksum.md5":["0e4f40e3f9d44c530275cce6aeb7ca2b","67d20f9a2370882497edf3156209879e"],"dc:identifier.uri":["https://scholarbank.nus.edu.sg/bitstreams/1a51b3b7-6314-45d8-ad50-06aa6a205076/download"],"dc:relation.isreferencedby":["https://scholarbank.nus.edu.sg/handle/10635/14510"],"dc:subject":["convex optimization, non-smooth optimization, semismooth function, sum of eigenvalues"],"dc:title":["Smooth convex approximation and its applications"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T03:32:43Z"}