SIAMJO 2002 - PDF Preprint Papers

SIAMJO 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMJO-2002 Paper

click to vote

SIAMJO
2002

159views more SIAMJO 2002»

Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method

13 years 4 months ago

Download web.mat.bham.ac.uk

A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...

Yun-Bin Zhao, Duan Li

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	159	Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method	claim
2	149	Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results	claim
3	142	A Complementary Pivoting Approach to the Maximum Weight Clique Problem	claim
4	133	SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization	claim
5	124	The Sample Average Approximation Method for Stochastic Discrete Optimization	claim
6	122	Robust Filtering via Semidefinite Programming with Applications to Target Tracking	claim
7	120	Dual Stochastic Dominance and Related Mean-Risk Models	claim
8	117	Analysis of Generalized Pattern Searches	claim
9	115	Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems	claim
10	107	A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds	claim
11	105	An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs	claim
12	102	Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems	claim
13	102	Block-Iterative Algorithms with Underrelaxed Bregman Projections	claim
14	100	Warm-Start Strategies in Interior-Point Methods for Linear Programming	claim
15	99	On the Calmness of a Class of Multifunctions	claim
16	99	Active Sets, Nonsmoothness, and Sensitivity	claim
17	96	Lagrangian Dual Interior-Point Methods for Semidefinite Programs	claim
18	96	A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier	claim
19	92	Generalized Bundle Methods	claim
20	89	A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems	claim
21	88	Subdifferential Conditions for Calmness of Convex Constraints	claim
22	87	An Optimization Approach for Radiosurgery Treatment Planning	claim
23	83	Analysis of Inexact Trust-Region SQP Algorithms	claim
24	77	Modifying SQP for Degenerate Problems	claim
25	73	Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification	claim
26	68	On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty	claim
27	64	A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers