A Subgradient Projection Method for Quasiconvex Minimization | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article A Subgradient Projection Method for Quasiconvex Minimization Felipe Lara, Raúl Marcavillaca, Juan Choque This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-4022333/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 05 Sep, 2024 Read the published version in Positivity → Version 1 posted 8 You are reading this latest preprint version Abstract In this paper, a subgradient projection method for quasiconvex minimization problems is provided. By using strong subdifferentials, it is proved that the generated sequence of the proposed algorithm converges to the solution of the minimization problem of a proper, lower semicontinuous and strongly quasiconvex function (in the sense of Polyak [18]) under the same assumptions than for convex functions with the convex subdifferential. Furthermore, a quasi-linear convergence rate of the iterates, which extends similar results for the general quasiconvex case, is also provided. Subgradient methods First-order methods Nonconvex optimization Generalized convexity Quasiconvexity Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 05 Sep, 2024 Read the published version in Positivity → Version 1 posted Editorial decision: Revision requested 20 Aug, 2024 Reviewers agreed at journal 18 Jul, 2024 Reviews received at journal 17 Jul, 2024 Reviewers agreed at journal 11 Mar, 2024 Reviewers invited by journal 11 Mar, 2024 Editor assigned by journal 09 Mar, 2024 Submission checks completed at journal 08 Mar, 2024 First submitted to journal 06 Mar, 2024 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-4022333","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":278340403,"identity":"5074857d-fe86-4790-8aa6-8f118024a10d","order_by":0,"name":"Felipe Lara","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABIUlEQVRIie3PsUrDQBjA8QuFZjnJ+hXUvkKCoIVW+io9CskSIZNk6HBZmkGl64k+RN7AyMG5nKNgyGIR6tLNxaEU74SCyiWz4P2HcBz3y3eHkM32B3Nph5YIDfS6u9tSH3/QSHDpaALfCC41gVaCfhKYoN2OmbhZxpMU+ic5F69pOiSL3ttT8ZEA8vKLiZHge8qZhOBWhlEgZUSub+Lz6lJdDORjYSJjIJTvzcFhKD7uZXNOijoOn7EiPpwZCe4vFdnCmHlrRbac3FUyrDZtBBxFKBAGegpVU8AVdesUrC7GBEwZrKKAiuiIybhb7/uAm96CXc7fk9nolHlTsaSz4cEif1hV683o0MuvjETX+bXG/tfPmo6biPvSdtpms9n+X5+9B2Zq6vlBNAAAAABJRU5ErkJggg==","orcid":"","institution":"University of Tarapacá","correspondingAuthor":true,"prefix":"","firstName":"Felipe","middleName":"","lastName":"Lara","suffix":""},{"id":278340404,"identity":"c91ea6e9-15fa-4766-9a39-7c9d64d2ae6c","order_by":1,"name":"Raúl Marcavillaca","email":"","orcid":"","institution":"University of Tarapacá","correspondingAuthor":false,"prefix":"","firstName":"Raúl","middleName":"","lastName":"Marcavillaca","suffix":""},{"id":278340406,"identity":"3e2cdd29-0528-45f4-94fd-88f886698b3c","order_by":2,"name":"Juan Choque","email":"","orcid":"","institution":"University of Tarapacá","correspondingAuthor":false,"prefix":"","firstName":"Juan","middleName":"","lastName":"Choque","suffix":""}],"badges":[],"createdAt":"2024-03-06 22:59:58","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-4022333/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-4022333/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s11117-024-01082-z","type":"published","date":"2024-09-05T16:05:00+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":64185671,"identity":"4a0fe806-8966-405a-b902-1a6b48819802","added_by":"auto","created_at":"2024-09-09 16:20:40","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":285502,"visible":true,"origin":"","legend":"","description":"","filename":"LaraRTMJC2024.pdf","url":"https://assets-eu.researchsquare.com/files/rs-4022333/v1_covered_01fe1d76-e786-4438-a86c-de72089ef426.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Subgradient Projection Method for Quasiconvex Minimization","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"positivity","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"post","sideBox":"Learn more about [Positivity](http://link.springer.com/journal/11117)","snPcode":"11117","submissionUrl":"https://submission.nature.com/new-submission/11117/3","title":"Positivity","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Subgradient methods, First-order methods, Nonconvex optimization, Generalized convexity, Quasiconvexity","lastPublishedDoi":"10.21203/rs.3.rs-4022333/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-4022333/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eIn this paper, a subgradient projection method for quasiconvex minimization problems is provided. By using strong subdifferentials, it is proved that the generated sequence of the proposed algorithm converges to the solution of the minimization problem of a proper, lower semicontinuous and strongly quasiconvex function (in the sense of Polyak [18]) under the same assumptions than for convex functions with the convex subdifferential. Furthermore, a quasi-linear convergence rate of the iterates, which extends similar results for the general quasiconvex case, is also provided.\u003c/p\u003e","manuscriptTitle":"A Subgradient Projection Method for Quasiconvex Minimization","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-03-14 17:06:37","doi":"10.21203/rs.3.rs-4022333/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2024-08-20T15:50:53+00:00","index":"","fulltext":""},{"type":"reviewerAgreed","content":"260207208499899902262144056593182214153","date":"2024-07-18T12:12:39+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2024-07-17T12:11:17+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"111ff181-fe5d-4401-a6c4-26634ae44f3a","date":"2024-03-11T14:12:41+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2024-03-11T08:17:43+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2024-03-09T17:03:58+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2024-03-08T17:39:53+00:00","index":"","fulltext":""},{"type":"submitted","content":"Positivity","date":"2024-03-06T22:36:44+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"positivity","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"post","sideBox":"Learn more about [Positivity](http://link.springer.com/journal/11117)","snPcode":"11117","submissionUrl":"https://submission.nature.com/new-submission/11117/3","title":"Positivity","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"a9add679-b1e3-4818-bc03-6ed0fb562fe1","owner":[],"postedDate":"March 14th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2024-09-09T16:09:48+00:00","versionOfRecord":{"articleIdentity":"rs-4022333","link":"https://doi.org/10.1007/s11117-024-01082-z","journal":{"identity":"positivity","isVorOnly":false,"title":"Positivity"},"publishedOn":"2024-09-05 16:05:00","publishedOnDateReadable":"September 5th, 2024"},"versionCreatedAt":"2024-03-14 17:06:37","video":"","vorDoi":"10.1007/s11117-024-01082-z","vorDoiUrl":"https://doi.org/10.1007/s11117-024-01082-z","workflowStages":[]},"version":"v1","identity":"rs-4022333","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-4022333","identity":"rs-4022333","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.