default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 12
Volume 12, Numbers 1-3, January 1999
- Jong-Shi Pang:
Guest Editorial. 5-12 - Abdo Y. Alfakih, Amir Khandani, Henry Wolkowicz:
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming. 13-30 - Alfred Auslender, Marc Teboulle, Sami Ben-Tiba:
A Logarithmic-Quadratic Proximal Method for Variational Inequalities. 31-40 - Dimitri P. Bertsekas:
A Note on Error Bounds for Convex and Nonconvex Programs. 41-51 - Erin J. Bredensteiner, Kristin P. Bennett:
Multicategory Classification by Support Vector Machines. 53-79 - Richard W. Cottle:
Quartic Barriers. 81-105 - Renato De Leone, Robert R. Meyer, Armand Zakarian:
A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems. 107-126 - Michel Denault, Jean-Louis Goffin:
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities. 127-155 - Gianni Di Pillo, Stefano Lucidi
, Laura Palagi:
A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems. 157-188 - B. Curtis Eaves, Uriel G. Rothblum:
Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems. 189-205 - Michael C. Ferris, Todd S. Munson:
Interfaces to PATH 3.0: Design, Implementation and Usage. 207-227 - M. Seetharama Gowda, Mohamed A. Tawhid:
Existence and Limiting Behavior of Trajectories Associated with P0-equations. 229-251 - William W. Hager:
Stabilized Sequential Quadratic Programming. 253-273
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.
last updated on 2026-08-09 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
