Naval Postgraduate School
Dudley Knox Library
NPS Dudley Knox Library
View Item 
  •   Calhoun Home
  • Reports and Technical Reports
  • All Technical Reports Collection
  • View Item
  •   Calhoun Home
  • Reports and Technical Reports
  • All Technical Reports Collection
  • View Item
  • How to search in Calhoun
  • My Accounts
  • Ask a Librarian
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of CalhounCollectionsThis Collection

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

Proximal minimization algorithms with cutting planes

Thumbnail
Download
Iconproximalminimiza00lawp.pdf (1.435Mb)
Download Record
Download to EndNote/RefMan (RIS)
Download to BibTex
Author
Lawphongpanich, Siriphong
Date
1991-12
Metadata
Show full item record
Abstract
This paper examines a class of proximal minimization algorithms in which the objective function of the underlying convex program is approximated by cutting planes. This class includes algorithms such as cutting plane, cutting plane with line search and bundle methods. Among these algorithms, the bundle methods can be viewed as a quadratic counterpart of the cutting plane algorithm with line search, for they both attempt to decrease the true objective function at every iteration. On the other hand, the cutting plane algorithm does not explicitly and/or directly attempt to decrease the true objective function. However, it relies on the monotonicity of the approximating function to guarantee convergence to an optimal solution. This prompts the question of whether there exists a quadratic counterpart for the cutting plane algorithm. To provide an affirmative answer, this paper constructs a new convergent algorithm which resembles, but is different from, the bundle methods. Also, to make the relationship between bundle methods and proximal minimization more concrete, this paper also supplies a convergence proof for a variant of the bundle methods which utilizes analysis common to proximal minimization
URI
http://hdl.handle.net/10945/30114
NPS Report Number
NPS-OR-92-011
Collections
  • All Technical Reports Collection
  • Operations Research (NPS-OR)

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    Route Optimization for Multiple Searchers 

    Royset, J.O.,; Sato, H. (2010);
    We consider a discrete time-and-space route-optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically mov- ing targets. The paper formulates a novel convex ...
  • Thumbnail

    A cascade approach for staircase linear programs with an application to Air Force mobility optimization 

    Baker, Steven F. (Monterey, California. Naval Postgraduate School, 1997-06);
    We develop a method to approximately solve a large staircase linear program that optimizes decisions over time. Also developed is a method to bound that approximation's error. A feasible solution is derived by a proximal ...
  • Thumbnail

    Nucleate pool boiling performance of finned and high flux tube bundles in R-114/oil mixtures 

    Akcasayar, Nezih (Monterey, California. Naval Postgraduate School, 1989-12);
    The heat transfer characteristics of pure R-114 and R-114/oil mixtures during nucleate pool boiling from a small bundle of finned and High Flux tubes were measured. The bundles had 5 instrumented and 10 additional heated ...
NPS Dudley Knox LibraryDUDLEY KNOX LIBRARY
Feedback

411 Dyer Rd. Bldg. 339
Monterey, CA 93943
circdesk@nps.edu
(831) 656-2947
DSN 756-2947

    Federal Depository Library      


Start Your Research

Research Guides
Academic Writing
Ask a Librarian
Copyright at NPS
Graduate Writing Center
How to Cite
Library Liaisons
Research Tools
Thesis Processing Office

Find & Download

Databases List
Articles, Books & More
NPS Theses
NPS Faculty Publications: Calhoun
Journal Titles
Course Reserves

Use the Library

My Accounts
Request Article or Book
Borrow, Renew, Return
Tech Help
Remote Access
Workshops & Tours

For Faculty & Researchers
For International Students
For Alumni

Print, Copy, Scan, Fax
Rooms & Study Spaces
Floor Map
Computers & Software
Adapters, Lockers & More

Collections

NPS Archive: Calhoun
Restricted Resources
Special Collections & Archives
Federal Depository
Homeland Security Digital Library

About

Hours
Library Staff
About Us
Special Exhibits
Policies
Our Affiliates
Visit Us

NPS-Licensed Resources—Terms & Conditions
Copyright Notice

Naval Postgraduate School

Naval Postgraduate School
1 University Circle, Monterey, CA 93943
Driving Directions | Campus Map

This is an official U.S. Navy Website |  Please read our Privacy Policy Notice  |  FOIA |  Section 508 |  No FEAR Act |  Whistleblower Protection |  Copyright and Accessibility |  Contact Webmaster

Export search results

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

A logged-in user can export up to 15000 items. If you're not logged in, you can export no more than 500 items.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.