"A new linesearch method for quadratically constrained convex programming."

Aaron Melman (1994)

> Home

Details and statistics

DOI: 10.1016/0167-6377(94)90062-0

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Melman94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Melman94
Aaron Melman:
A new linesearch method for quadratically constrained convex programming. Oper. Res. Lett. 16(2): 67-77 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.