[Coin-ipopt] Ipopt feature request -- Phase 1 problem

[Kirk Abbott]

Hello All,

Does Ipopt have a feasibility mode? By this I mean, each constraint is
relaxed
appropriately and a phase 1 problem is solved and the most violated
constraints
are reported.

Clearly this can be done from the model level, but is perhaps most
efficiently done
from the solver.

Does anyone else need/want this functionality?
Thoughts?

Thanks,
Kirk.


 -----Original Message-----
From: 	coin-ipopt-request at www-124.ibm.com
[mailto:coin-ipopt-request at www-124.ibm.com] 
Sent:	Monday, April 26, 2004 11:01 AM
To:	coin-ipopt at www-124.ibm.com
Subject:	Coin-ipopt digest, Vol 1 #55 - 1 msg

Send Coin-ipopt mailing list submissions to
	coin-ipopt at www-124.ibm.com

To subscribe or unsubscribe via the World Wide Web, visit
	
http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-ipopt
or, via email, send a message with subject or body 'help' to
	coin-ipopt-request at www-124.ibm.com

You can reach the person managing the list at
	coin-ipopt-admin at www-124.ibm.com

When replying, please edit your Subject line so it is more specific
than "Re: Contents of Coin-ipopt digest..."


Today's Topics:

   1. new minor release 2.2.1 (Andreas Waechter)

--__--__--

Message: 1
Date: Sun, 25 Apr 2004 19:14:45 -0400 (EDT)
From: Andreas Waechter <andreasw at watson.ibm.com>
To: coin-ipopt mailing list <coin-ipopt at www-126.southbury.usf.ibm.com>
Subject: [Coin-ipopt] new minor release 2.2.1

NEW VERSION 2.2.1

A new minor release of IPOPT, version 2.2.1, has just been submitted to
the CVS repository.  It will be available in the regular tarballs by
tomorrow.

A list of the change (from CHANGELOG) follows:

2004-04-25   Release of Version 2.2.1.

- AMPL solver executable is now called `ipopt' (instead of `ipoptAMPL')
  This fixed also problem with assigning IPOPT options from within
  AMPL. (reported by Karsten Theissen)

- default value for number of iterations is now 10000 (instead of 1000)

- new option: IMAXCPUSEC to be set to the maximum number of CPU seconds
  after which the algorithm should stop.  The check is performed only at
  certain points in the algorithm, so that the executable might run longer
  than specified.
  The algorithm also stops (as before) when the file "STOP" is detected in
  the current directory.  Finally, a call to `USER_REQUESTED_STOP' has
  been added if the preprocessor macro USE_USER_REQUESTED_STOP has been
  defined. If this LOGICAL function returns .TRUE., the algorithm also
  stops.  This feature was requested by David Ternet.

- if IPOPT is run several time in a row, the counting of function
  evaluations is restarted after every new call of IPOPT.

- in get_step_full, now check if the number of negative eigenvalues is LESS
  than then number constraints.  If so, increase the pivot tolerance,
  and if that doesn't help, pretend that the system is singular.
  (this fixed a problem reported by Hans Mittelmann)

- decrease default values for DPIVTOLMAX

- suppress superflous leading zeros in iteration output.  For long output
  (ioutput=1) include CPU time

- a few changes regarding the inertia correction (get_step_full.F).
  This decreases CPU time significantly in a few cases.

- corrected problem in C-files related to names for struct's (some GNU
  compiler complained)

- changed default options for GNU compilers (now `-O3 -funroll-loops',
  no longer `-O2' and `-mieee-fp')

- no reference to MC35 in resto_tron if HAVE_MC35 is not defined

- '#error' preprocessor directive removed from *.F files, since not all
  compilers understand it (reported by Hans Mittelmann)

- switch to automake 1.8.3





--__--__--

_______________________________________________
Coin-ipopt mailing list
Coin-ipopt at www-124.ibm.com
http://www-124.ibm.com/developerworks/oss/mailman/listinfo/coin-ipopt


End of Coin-ipopt Digest


--------
This e-mail is for the designated recipient only and may contain privileged
or confidential information. If you have received it in error, please notify
the sender immediately and delete the original. Any other use of this e-mail
is prohibited.