Convex Optimization—Theory, Algorithms and Applications
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Convex Optimization—Theory, Algorithms and Applications: RTCOTAA-2020, Patna, India, October 29–31
Convex Optimization—Theory, Algorithms and Applications: RTCOTAA-2020, Patna, India, October 29–31

Convex Optimization—Theory, Algorithms and Applications: RTCOTAA-2020, Patna, India, October 29–31

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

This volume includes chapters on topics presented at the conference on Recent Trends in Convex Optimization: Theory, Algorithms and Applications (RTCOTAA-2020), held at the Department of Mathematics, Indian Institute of Technology Patna, Bihar, India, from 29–31 October 2020. It discusses a comprehensive exploration of the realm of optimization, encompassing both the theoretical underpinnings and the multifaceted real-life implementations of the optimization theory. It meticulously features essential optimization concepts, such as convex analysis, generalized convexity, monotonicity, etc., elucidating their theoretical advancements and significance in the optimization sphere. Multiobjective optimization is a pivotal topic which addresses the inherent difficulties faced in conflicting objectives. The book delves into various theoretical concepts and covers some practical algorithmic approaches to solve multiobjective optimization, such as the line search and the enhanced non-monotone quasi-Newton algorithms. It also deliberates on several other significant topics in optimization, such as the perturbation approach for vector optimization, and solution methods for set-valued optimization. Nonsmooth optimization is extensively covered, with in-depth discussions on various well-known tools of nonsmooth analysis, such as convexificators, limiting subdifferentials, tangential subdifferentials, quasi-differentials, etc. Notable optimization algorithms, such as the interior point algorithm and Lemke’s algorithm, are dissected in detail, offering insights into their applicability and effectiveness. The book explores modern applications of optimization theory, for instance, optimized image encryption, resource allocation, target tracking problems, deep learning, entropy optimization, etc. Ranging from gradient-based optimization algorithms to metaheuristic approaches such as particle swarm optimization, the book navigates through the intersection of optimization theory and deep learning, thereby unravelling new research perspectives in artificial intelligence, machine learning and other fields of modern science. Designed primarily for graduate students and researchers across a variety of disciplines such as mathematics, operations research, electrical and electronics engineering, computer science, robotics, deep learning, image processing and artificial intelligence, this book serves as a comprehensive resource for someone interested in exploring the multifaceted domain of mathematical optimization and its myriad applications.

Table of Contents:
P. Marechal, Elements of Convex Analysis.- T. Antczak, Solution Concepts in Vector Optimization – an Overview.- J.-P. Crouzeix, Generalized Convexity and Generalized Monotonicity.-  N. Dinh, D. H. Long, A Perturbation Approach to Vector Optimization Problems.- K. Som, V. Vetrivel, Results on Existence of l-Minimal and u-Minimal Solutions in Set-Valued Optimization: a Brief Survey.- Q. H. Ansari, N. Hussain, Pradeep Kumar Sharma, Scalarization for Set Optimization in Vector Spaces.- A. K. Das, A. Dutta, R. Jana, Complementarity Problems and Its Relation with Optimization Theory.- B. Kohli, Convexificators and Their Role in Nonsmooth Optimization.- S. Treanta, N. Abdulaleem, On Variational Derivative and Controlled Variational Inequalities.- L. T. Tung, Tangential Subdifferential and Its Role in Optimization.- K. Som, J. Dutta, Limiting subdifferential and its role in optimization.- V. Laha, H. N. Singh, S. K. Mishra, On Quasidifferentiable Mathematical Programs with Vanishing Constraints.- N. Kanzi, A. Kabgani, G. Caristi, D. Barilla, On Nonsmooth Semi-Infinite Programming Problems.- P. Marechal, Entropy Optimization.- S. K. Neogy, G. Singh, Lemke’s Algorithm and a Class of Convex Optimization Problem.- S. K. Neogy, R. Chakravorty, S. Ghosh, Interior Point Methods for Some Special Classes of Optimization Problems.- G. Panda, M. A. T. Ansary, Review on Line Search Techniques for Nonlinear Multi-objective Optimization Problems.- K. Kumar, A. Singh, A. Upadhayay, D. Ghosh, An Improved Nonmonotone Quasi-Newton Method for Multiobjective Optimization Problems.- A. K. Agrawal, S. Yadav, A. Chouksey, A. Ray, Particle Swarm Optimization and Its role in Solving Unconstrained and Constrained Optimization Problems.- E. Pauwels,  Introduction to Optimization for Deep Learning.- G. Shukla, N. D. Chaturvedi, Optimization in Resource Allocation Network.- M. Kumar, B. Mishra, N. Deep, A Survey on Optimized Based Image Encryption Techniques.- U. Asfia and R. Radhakrishnan, Parametrised Maximum Correntropy Estimation for 2D and 3D Angles-Only Target Tracking Problem.


Best Sellers


Product Details
  • ISBN-13: 9789819789061
  • Publisher: Springer Verlag, Singapore
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 9819789060
  • Publisher Date: 29 Mar 2025
  • Height: 235 mm
  • No of Pages: 508
  • Sub Title: RTCOTAA-2020, Patna, India, October 29–31


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Convex Optimization—Theory, Algorithms and Applications: RTCOTAA-2020, Patna, India, October 29–31
Springer Verlag, Singapore -
Convex Optimization—Theory, Algorithms and Applications: RTCOTAA-2020, Patna, India, October 29–31
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Convex Optimization—Theory, Algorithms and Applications: RTCOTAA-2020, Patna, India, October 29–31

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!